Fast algorithms for some dominating induced matching problems

Autores
Lin, Min Chih; Mizrahi, Michel Jonathan; Szwarcfiter, Jayme L.
Año de publicación
2014
Idioma
inglés
Tipo de recurso
artículo
Estado
versión publicada
Descripción
We describe O(n) time algorithms for finding the minimum weighted dominating induced matching of chordal, dually chordal, biconvex, and claw-free graphs. For the first three classes, we prove tight O(n) bounds on the maximum number of edges that a graph having a dominating induced matching may contain. By applying these bounds, and employing existing O(n + m) time algorithms we show that they can be reduced to O(n) time. For claw-free graphs, we describe a variation of the existing algorithm for solving the unweighted version of the problem, which decreases its complexity from O(n2) to O(n), while additionally solving the weighted version. The same algorithm can be easily modified to count the number of DIM’s of the given graph.
Fil: Lin, Min Chih. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación; 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. Departamento de Computación; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina
Fil: Szwarcfiter, Jayme L.. Instituto Nacional de Metrologia, Qualidade e Tecnologia; Brasil
Materia
Algorithms
Dominating Induced Matchings
Graph Theory
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/33031
Acceder
id CONICETDig_c223181497d37e93709dd9127bee6d61
oai_identifier_str oai:ri.conicet.gov.ar:11336/33031
network_acronym_str CONICETDig
repository_id_str 3498
network_name_str CONICET Digital (CONICET)
spelling Fast algorithms for some dominating induced matching problemsLin, Min ChihMizrahi, Michel JonathanSzwarcfiter, Jayme L.AlgorithmsDominating Induced MatchingsGraph Theoryhttps://purl.org/becyt/ford/1.1https://purl.org/becyt/ford/1https://purl.org/becyt/ford/1.2https://purl.org/becyt/ford/1We describe O(n) time algorithms for finding the minimum weighted dominating induced matching of chordal, dually chordal, biconvex, and claw-free graphs. For the first three classes, we prove tight O(n) bounds on the maximum number of edges that a graph having a dominating induced matching may contain. By applying these bounds, and employing existing O(n + m) time algorithms we show that they can be reduced to O(n) time. For claw-free graphs, we describe a variation of the existing algorithm for solving the unweighted version of the problem, which decreases its complexity from O(n2) to O(n), while additionally solving the weighted version. The same algorithm can be easily modified to count the number of DIM’s of the given graph.Fil: Lin, Min Chih. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; ArgentinaFil: Mizrahi, Michel Jonathan. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; ArgentinaFil: Szwarcfiter, Jayme L.. Instituto Nacional de Metrologia, Qualidade e Tecnologia; BrasilElsevier Science2014-05info: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/33031Mizrahi, Michel Jonathan; Szwarcfiter, Jayme L.; Lin, Min Chih; Fast algorithms for some dominating induced matching problems; Elsevier Science; Information Processing Letters; 114; 10; 5-2014; 524-5280020-0190CONICET DigitalCONICETenginfo:eu-repo/semantics/altIdentifier/doi/10.1016/j.ipl.2014.04.012info:eu-repo/semantics/altIdentifier/url/http://www.sciencedirect.com/science/article/pii/S002001901400091Xinfo: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-09-17T10:40:37Zoai:ri.conicet.gov.ar:11336/33031instacron: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-09-17 10:40:38.104CONICET Digital (CONICET) - Consejo Nacional de Investigaciones Científicas y Técnicasfalse
dc.title.none.fl_str_mv Fast algorithms for some dominating induced matching problems
title Fast algorithms for some dominating induced matching problems
spellingShingle Fast algorithms for some dominating induced matching problems
Lin, Min Chih
Algorithms
Dominating Induced Matchings
Graph Theory
title_short Fast algorithms for some dominating induced matching problems
title_full Fast algorithms for some dominating induced matching problems
title_fullStr Fast algorithms for some dominating induced matching problems
title_full_unstemmed Fast algorithms for some dominating induced matching problems
title_sort Fast algorithms for some dominating induced matching problems
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 Algorithms
Dominating Induced Matchings
Graph Theory
topic Algorithms
Dominating Induced Matchings
Graph Theory
purl_subject.fl_str_mv https://purl.org/becyt/ford/1.1
https://purl.org/becyt/ford/1
https://purl.org/becyt/ford/1.2
https://purl.org/becyt/ford/1
dc.description.none.fl_txt_mv We describe O(n) time algorithms for finding the minimum weighted dominating induced matching of chordal, dually chordal, biconvex, and claw-free graphs. For the first three classes, we prove tight O(n) bounds on the maximum number of edges that a graph having a dominating induced matching may contain. By applying these bounds, and employing existing O(n + m) time algorithms we show that they can be reduced to O(n) time. For claw-free graphs, we describe a variation of the existing algorithm for solving the unweighted version of the problem, which decreases its complexity from O(n2) to O(n), while additionally solving the weighted version. The same algorithm can be easily modified to count the number of DIM’s of the given graph.
Fil: Lin, Min Chih. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación; 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. Departamento de Computación; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina
Fil: Szwarcfiter, Jayme L.. Instituto Nacional de Metrologia, Qualidade e Tecnologia; Brasil
description We describe O(n) time algorithms for finding the minimum weighted dominating induced matching of chordal, dually chordal, biconvex, and claw-free graphs. For the first three classes, we prove tight O(n) bounds on the maximum number of edges that a graph having a dominating induced matching may contain. By applying these bounds, and employing existing O(n + m) time algorithms we show that they can be reduced to O(n) time. For claw-free graphs, we describe a variation of the existing algorithm for solving the unweighted version of the problem, which decreases its complexity from O(n2) to O(n), while additionally solving the weighted version. The same algorithm can be easily modified to count the number of DIM’s of the given graph.
publishDate 2014
dc.date.none.fl_str_mv 2014-05
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/33031
Mizrahi, Michel Jonathan; Szwarcfiter, Jayme L.; Lin, Min Chih; Fast algorithms for some dominating induced matching problems; Elsevier Science; Information Processing Letters; 114; 10; 5-2014; 524-528
0020-0190
CONICET Digital
CONICET
url http://hdl.handle.net/11336/33031
identifier_str_mv Mizrahi, Michel Jonathan; Szwarcfiter, Jayme L.; Lin, Min Chih; Fast algorithms for some dominating induced matching problems; Elsevier Science; Information Processing Letters; 114; 10; 5-2014; 524-528
0020-0190
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.ipl.2014.04.012
info:eu-repo/semantics/altIdentifier/url/http://www.sciencedirect.com/science/article/pii/S002001901400091X
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 Science
publisher.none.fl_str_mv Elsevier Science
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_ 1843605832908931072
score 13.000565

Publicaciones similares