On the Complexity of {k}-domination for Chordal Graphs
- Autores
- Argiroffo, G.; Leoni, V.; Torres, P.
- Año de publicación
- 2013
- Idioma
- inglés
- Tipo de recurso
- documento de conferencia
- Estado
- versión publicada
- Descripción
- In this work we obtain a new graph class where {k}-DOM is NP-complete: the class of chordal graphs. We also identify some maximal subclasses for which it is polynomial time solvable. By relating this problem with k-DOM, we prove that {k}-DOM is polynomial time solvable for strongly chordal graphs. Besides, by expressing the property involved in k-DOM in Counting Monadic Second- order Logic, we obtain that both problems are linear time solvable for bounded tree-width graphs. In this way we enlarge the family of graphs for which k-DOM is polynomial time solvable.
Sociedad Argentina de Informática e Investigación Operativa - Materia
-
Ciencias Informáticas
Chordal graphs
k-DOM - Nivel de accesibilidad
- acceso abierto
- Condiciones de uso
- http://creativecommons.org/licenses/by-nc-sa/4.0/
- Repositorio
.jpg)
- Institución
- Universidad Nacional de La Plata
- OAI Identificador
- oai:sedici.unlp.edu.ar:10915/94545
Ver los metadatos del registro completo
| id |
SEDICI_e80957498f87e742fbc96f3ad4388e21 |
|---|---|
| oai_identifier_str |
oai:sedici.unlp.edu.ar:10915/94545 |
| network_acronym_str |
SEDICI |
| repository_id_str |
1329 |
| network_name_str |
SEDICI (UNLP) |
| spelling |
On the Complexity of {k}-domination for Chordal GraphsArgiroffo, G.Leoni, V.Torres, P.Ciencias InformáticasChordal graphsk-DOMIn this work we obtain a new graph class where {k}-DOM is NP-complete: the class of chordal graphs. We also identify some maximal subclasses for which it is polynomial time solvable. By relating this problem with k-DOM, we prove that {k}-DOM is polynomial time solvable for strongly chordal graphs. Besides, by expressing the property involved in k-DOM in Counting Monadic Second- order Logic, we obtain that both problems are linear time solvable for bounded tree-width graphs. In this way we enlarge the family of graphs for which k-DOM is polynomial time solvable.Sociedad Argentina de Informática e Investigación Operativa2013-09info:eu-repo/semantics/conferenceObjectinfo:eu-repo/semantics/publishedVersionResumenhttp://purl.org/coar/resource_type/c_5794info:ar-repo/semantics/documentoDeConferenciaapplication/pdf4http://sedici.unlp.edu.ar/handle/10915/94545enginfo:eu-repo/semantics/altIdentifier/issn/1850-2865info:eu-repo/semantics/openAccesshttp://creativecommons.org/licenses/by-nc-sa/4.0/Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)reponame:SEDICI (UNLP)instname:Universidad Nacional de La Platainstacron:UNLP2025-09-29T11:19:42Zoai:sedici.unlp.edu.ar:10915/94545Institucionalhttp://sedici.unlp.edu.ar/Universidad públicaNo correspondehttp://sedici.unlp.edu.ar/oai/snrdalira@sedici.unlp.edu.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:13292025-09-29 11:19:42.569SEDICI (UNLP) - Universidad Nacional de La Platafalse |
| dc.title.none.fl_str_mv |
On the Complexity of {k}-domination for Chordal Graphs |
| title |
On the Complexity of {k}-domination for Chordal Graphs |
| spellingShingle |
On the Complexity of {k}-domination for Chordal Graphs Argiroffo, G. Ciencias Informáticas Chordal graphs k-DOM |
| title_short |
On the Complexity of {k}-domination for Chordal Graphs |
| title_full |
On the Complexity of {k}-domination for Chordal Graphs |
| title_fullStr |
On the Complexity of {k}-domination for Chordal Graphs |
| title_full_unstemmed |
On the Complexity of {k}-domination for Chordal Graphs |
| title_sort |
On the Complexity of {k}-domination for Chordal Graphs |
| dc.creator.none.fl_str_mv |
Argiroffo, G. Leoni, V. Torres, P. |
| author |
Argiroffo, G. |
| author_facet |
Argiroffo, G. Leoni, V. Torres, P. |
| author_role |
author |
| author2 |
Leoni, V. Torres, P. |
| author2_role |
author author |
| dc.subject.none.fl_str_mv |
Ciencias Informáticas Chordal graphs k-DOM |
| topic |
Ciencias Informáticas Chordal graphs k-DOM |
| dc.description.none.fl_txt_mv |
In this work we obtain a new graph class where {k}-DOM is NP-complete: the class of chordal graphs. We also identify some maximal subclasses for which it is polynomial time solvable. By relating this problem with k-DOM, we prove that {k}-DOM is polynomial time solvable for strongly chordal graphs. Besides, by expressing the property involved in k-DOM in Counting Monadic Second- order Logic, we obtain that both problems are linear time solvable for bounded tree-width graphs. In this way we enlarge the family of graphs for which k-DOM is polynomial time solvable. Sociedad Argentina de Informática e Investigación Operativa |
| description |
In this work we obtain a new graph class where {k}-DOM is NP-complete: the class of chordal graphs. We also identify some maximal subclasses for which it is polynomial time solvable. By relating this problem with k-DOM, we prove that {k}-DOM is polynomial time solvable for strongly chordal graphs. Besides, by expressing the property involved in k-DOM in Counting Monadic Second- order Logic, we obtain that both problems are linear time solvable for bounded tree-width graphs. In this way we enlarge the family of graphs for which k-DOM is polynomial time solvable. |
| publishDate |
2013 |
| dc.date.none.fl_str_mv |
2013-09 |
| dc.type.none.fl_str_mv |
info:eu-repo/semantics/conferenceObject info:eu-repo/semantics/publishedVersion Resumen http://purl.org/coar/resource_type/c_5794 info:ar-repo/semantics/documentoDeConferencia |
| format |
conferenceObject |
| status_str |
publishedVersion |
| dc.identifier.none.fl_str_mv |
http://sedici.unlp.edu.ar/handle/10915/94545 |
| url |
http://sedici.unlp.edu.ar/handle/10915/94545 |
| dc.language.none.fl_str_mv |
eng |
| language |
eng |
| dc.relation.none.fl_str_mv |
info:eu-repo/semantics/altIdentifier/issn/1850-2865 |
| dc.rights.none.fl_str_mv |
info:eu-repo/semantics/openAccess http://creativecommons.org/licenses/by-nc-sa/4.0/ Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0) |
| eu_rights_str_mv |
openAccess |
| rights_invalid_str_mv |
http://creativecommons.org/licenses/by-nc-sa/4.0/ Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0) |
| dc.format.none.fl_str_mv |
application/pdf 4 |
| dc.source.none.fl_str_mv |
reponame:SEDICI (UNLP) instname:Universidad Nacional de La Plata instacron:UNLP |
| reponame_str |
SEDICI (UNLP) |
| collection |
SEDICI (UNLP) |
| instname_str |
Universidad Nacional de La Plata |
| instacron_str |
UNLP |
| institution |
UNLP |
| repository.name.fl_str_mv |
SEDICI (UNLP) - Universidad Nacional de La Plata |
| repository.mail.fl_str_mv |
alira@sedici.unlp.edu.ar |
| _version_ |
1844616071129071616 |
| score |
13.070432 |