Efficient and Perfect domination on circular-arc graphs

Autores
Lin, Min Chih; Mizrahi, Michel Jonathan; Szwarcfiter, Jayme L.
Año de publicación
2015
Idioma
inglés
Tipo de recurso
artículo
Estado
versión publicada
Descripción
Given a graph G = (V,E), a perfect dominating set is a subset of vertices V ⊆ V (G) such that each vertex v ∈ V (G) \ V is dominated by exactly one vertex v ∈ V . An efficient dominating set is a perfect dominating set V where V is also an independent set. These problems are usually posed in terms of edges instead of vertices. Both problems, either for the vertex or edge variant, remains NP-Hard, even when restricted to certain graphs families. We study both variants of the problems for the circular-arc graphs, and show efficient algorithms for all of them.
Fil: Lin, Min Chih. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Instituto de Cálculo; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina
Fil: Mizrahi, Michel Jonathan. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Instituto de Cálculo; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina
Fil: Szwarcfiter, Jayme L.. Universidade Federal do Rio de Janeiro; Brasil
Materia
Efficient Domination
Perfect Domination
Circular-Arc Graphs
Nivel de accesibilidad
acceso abierto
Condiciones de uso
https://creativecommons.org/licenses/by-nc-nd/2.5/ar/
Repositorio
CONICET Digital (CONICET)
Institución
Consejo Nacional de Investigaciones Científicas y Técnicas
OAI Identificador
oai:ri.conicet.gov.ar:11336/59584
Acceder
id CONICETDig_737be0157652f932fcd2a8d9cc85a42a
oai_identifier_str oai:ri.conicet.gov.ar:11336/59584
network_acronym_str CONICETDig
repository_id_str 3498
network_name_str CONICET Digital (CONICET)
spelling Efficient and Perfect domination on circular-arc graphsLin, Min ChihMizrahi, Michel JonathanSzwarcfiter, Jayme L.Efficient DominationPerfect DominationCircular-Arc Graphshttps://purl.org/becyt/ford/1.2https://purl.org/becyt/ford/1Given a graph G = (V,E), a perfect dominating set is a subset of vertices V ⊆ V (G) such that each vertex v ∈ V (G) \ V is dominated by exactly one vertex v ∈ V . An efficient dominating set is a perfect dominating set V where V is also an independent set. These problems are usually posed in terms of edges instead of vertices. Both problems, either for the vertex or edge variant, remains NP-Hard, even when restricted to certain graphs families. We study both variants of the problems for the circular-arc graphs, and show efficient algorithms for all of them.Fil: Lin, Min Chih. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Instituto de Cálculo; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; ArgentinaFil: Mizrahi, Michel Jonathan. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Instituto de Cálculo; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; ArgentinaFil: Szwarcfiter, Jayme L.. Universidade Federal do Rio de Janeiro; BrasilElsevier2015-12info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionhttp://purl.org/coar/resource_type/c_6501info:ar-repo/semantics/articuloapplication/pdfapplication/pdfhttp://hdl.handle.net/11336/59584Lin, Min Chih; Mizrahi, Michel Jonathan; Szwarcfiter, Jayme L.; Efficient and Perfect domination on circular-arc graphs; Elsevier; Electronic Notes in Discrete Mathematics; 50; 12-2015; 307-3121571-0653CONICET DigitalCONICETenginfo:eu-repo/semantics/altIdentifier/doi/10.1016/j.endm.2015.07.051info:eu-repo/semantics/altIdentifier/url/https://www.sciencedirect.com/science/article/pii/S1571065315002061info:eu-repo/semantics/openAccesshttps://creativecommons.org/licenses/by-nc-nd/2.5/ar/reponame:CONICET Digital (CONICET)instname:Consejo Nacional de Investigaciones Científicas y Técnicas2025-10-15T15:35:55Zoai:ri.conicet.gov.ar:11336/59584instacron:CONICETInstitucionalhttp://ri.conicet.gov.ar/Organismo científico-tecnológicoNo correspondehttp://ri.conicet.gov.ar/oai/requestdasensio@conicet.gov.ar; lcarlino@conicet.gov.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:34982025-10-15 15:35:55.366CONICET Digital (CONICET) - Consejo Nacional de Investigaciones Científicas y Técnicasfalse
dc.title.none.fl_str_mv Efficient and Perfect domination on circular-arc graphs
title Efficient and Perfect domination on circular-arc graphs
spellingShingle Efficient and Perfect domination on circular-arc graphs
Lin, Min Chih
Efficient Domination
Perfect Domination
Circular-Arc Graphs
title_short Efficient and Perfect domination on circular-arc graphs
title_full Efficient and Perfect domination on circular-arc graphs
title_fullStr Efficient and Perfect domination on circular-arc graphs
title_full_unstemmed Efficient and Perfect domination on circular-arc graphs
title_sort Efficient and Perfect domination on circular-arc graphs
dc.creator.none.fl_str_mv Lin, Min Chih
Mizrahi, Michel Jonathan
Szwarcfiter, Jayme L.
author Lin, Min Chih
author_facet Lin, Min Chih
Mizrahi, Michel Jonathan
Szwarcfiter, Jayme L.
author_role author
author2 Mizrahi, Michel Jonathan
Szwarcfiter, Jayme L.
author2_role author
author
dc.subject.none.fl_str_mv Efficient Domination
Perfect Domination
Circular-Arc Graphs
topic Efficient Domination
Perfect Domination
Circular-Arc Graphs
purl_subject.fl_str_mv https://purl.org/becyt/ford/1.2
https://purl.org/becyt/ford/1
dc.description.none.fl_txt_mv Given a graph G = (V,E), a perfect dominating set is a subset of vertices V ⊆ V (G) such that each vertex v ∈ V (G) \ V is dominated by exactly one vertex v ∈ V . An efficient dominating set is a perfect dominating set V where V is also an independent set. These problems are usually posed in terms of edges instead of vertices. Both problems, either for the vertex or edge variant, remains NP-Hard, even when restricted to certain graphs families. We study both variants of the problems for the circular-arc graphs, and show efficient algorithms for all of them.
Fil: Lin, Min Chih. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Instituto de Cálculo; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina
Fil: Mizrahi, Michel Jonathan. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Instituto de Cálculo; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina
Fil: Szwarcfiter, Jayme L.. Universidade Federal do Rio de Janeiro; Brasil
description Given a graph G = (V,E), a perfect dominating set is a subset of vertices V ⊆ V (G) such that each vertex v ∈ V (G) \ V is dominated by exactly one vertex v ∈ V . An efficient dominating set is a perfect dominating set V where V is also an independent set. These problems are usually posed in terms of edges instead of vertices. Both problems, either for the vertex or edge variant, remains NP-Hard, even when restricted to certain graphs families. We study both variants of the problems for the circular-arc graphs, and show efficient algorithms for all of them.
publishDate 2015
dc.date.none.fl_str_mv 2015-12
dc.type.none.fl_str_mv info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
http://purl.org/coar/resource_type/c_6501
info:ar-repo/semantics/articulo
format article
status_str publishedVersion
dc.identifier.none.fl_str_mv http://hdl.handle.net/11336/59584
Lin, Min Chih; Mizrahi, Michel Jonathan; Szwarcfiter, Jayme L.; Efficient and Perfect domination on circular-arc graphs; Elsevier; Electronic Notes in Discrete Mathematics; 50; 12-2015; 307-312
1571-0653
CONICET Digital
CONICET
url http://hdl.handle.net/11336/59584
identifier_str_mv Lin, Min Chih; Mizrahi, Michel Jonathan; Szwarcfiter, Jayme L.; Efficient and Perfect domination on circular-arc graphs; Elsevier; Electronic Notes in Discrete Mathematics; 50; 12-2015; 307-312
1571-0653
CONICET Digital
CONICET
dc.language.none.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv info:eu-repo/semantics/altIdentifier/doi/10.1016/j.endm.2015.07.051
info:eu-repo/semantics/altIdentifier/url/https://www.sciencedirect.com/science/article/pii/S1571065315002061
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
https://creativecommons.org/licenses/by-nc-nd/2.5/ar/
eu_rights_str_mv openAccess
rights_invalid_str_mv https://creativecommons.org/licenses/by-nc-nd/2.5/ar/
dc.format.none.fl_str_mv application/pdf
application/pdf
dc.publisher.none.fl_str_mv Elsevier
publisher.none.fl_str_mv Elsevier
dc.source.none.fl_str_mv reponame:CONICET Digital (CONICET)
instname:Consejo Nacional de Investigaciones Científicas y Técnicas
reponame_str CONICET Digital (CONICET)
collection CONICET Digital (CONICET)
instname_str Consejo Nacional de Investigaciones Científicas y Técnicas
repository.name.fl_str_mv CONICET Digital (CONICET) - Consejo Nacional de Investigaciones Científicas y Técnicas
repository.mail.fl_str_mv dasensio@conicet.gov.ar; lcarlino@conicet.gov.ar
_version_ 1846083484037152768
score 13.22299

Publicaciones similares