A linear-time algorithm for the identifying code problem on block graphs

Autores
Argiroffo, Gabriela Rut; Bianchi, Silvia María; Lucarini, Yanina Paola; Wagler, Annegret Katrin
Año de publicación
2017
Idioma
inglés
Tipo de recurso
artículo
Estado
versión publicada
Descripción
The identifying code problem is a special search problem, challenging both from a theoretical and from a computational point of view, even for several graphs where other usually hard problems are easy to solve, like bipartite graphs or chordal graphs. Hence, a typical line of attack for this problem is to determine minimum identifying codes of special graphs. In this work we study the problem of determining the cardinality of a minimum identifying code in block graphs (that are diamond-free chordal graphs). We present a linear-time algorithm for this problem, as a generalization of a linear-time algorithm proposed by Auger in 2010 for the case of trees. Thereby, we provide a subclass of chordal graphs for which the identifying code problem can be solved in linear time.
Fil: Argiroffo, Gabriela Rut. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina. Universidad Nacional de Rosario. Facultad de Ciencias Exactas Ingeniería y Agrimensura. Escuela de Ciencias Exactas y Naturales. Departamento de Matemática; Argentina
Fil: Bianchi, Silvia María. Universidad Nacional de Rosario. Facultad de Ciencias Exactas Ingeniería y Agrimensura. Escuela de Ciencias Exactas y Naturales. Departamento de Matemática; Argentina
Fil: Lucarini, Yanina Paola. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina. Universidad Nacional de Rosario. Facultad de Ciencias Exactas Ingeniería y Agrimensura. Escuela de Ciencias Exactas y Naturales. Departamento de Matemática; Argentina
Fil: Wagler, Annegret Katrin. University Clermont Auvergne; Francia
Materia
Block Graphs
Computational Complexity
Identifying Codes
Nivel de accesibilidad
acceso abierto
Condiciones de uso
https://creativecommons.org/licenses/by-nc-sa/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/84375
Acceder
id CONICETDig_ae28b276ecb2cc7dc03206452eea8cfa
oai_identifier_str oai:ri.conicet.gov.ar:11336/84375
network_acronym_str CONICETDig
repository_id_str 3498
network_name_str CONICET Digital (CONICET)
spelling A linear-time algorithm for the identifying code problem on block graphsArgiroffo, Gabriela RutBianchi, Silvia MaríaLucarini, Yanina PaolaWagler, Annegret KatrinBlock GraphsComputational ComplexityIdentifying Codeshttps://purl.org/becyt/ford/1.1https://purl.org/becyt/ford/1The identifying code problem is a special search problem, challenging both from a theoretical and from a computational point of view, even for several graphs where other usually hard problems are easy to solve, like bipartite graphs or chordal graphs. Hence, a typical line of attack for this problem is to determine minimum identifying codes of special graphs. In this work we study the problem of determining the cardinality of a minimum identifying code in block graphs (that are diamond-free chordal graphs). We present a linear-time algorithm for this problem, as a generalization of a linear-time algorithm proposed by Auger in 2010 for the case of trees. Thereby, we provide a subclass of chordal graphs for which the identifying code problem can be solved in linear time.Fil: Argiroffo, Gabriela Rut. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina. Universidad Nacional de Rosario. Facultad de Ciencias Exactas Ingeniería y Agrimensura. Escuela de Ciencias Exactas y Naturales. Departamento de Matemática; ArgentinaFil: Bianchi, Silvia María. Universidad Nacional de Rosario. Facultad de Ciencias Exactas Ingeniería y Agrimensura. Escuela de Ciencias Exactas y Naturales. Departamento de Matemática; ArgentinaFil: Lucarini, Yanina Paola. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina. Universidad Nacional de Rosario. Facultad de Ciencias Exactas Ingeniería y Agrimensura. Escuela de Ciencias Exactas y Naturales. Departamento de Matemática; ArgentinaFil: Wagler, Annegret Katrin. University Clermont Auvergne; FranciaElsevier Science2017-11info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionhttp://purl.org/coar/resource_type/c_6501info:ar-repo/semantics/articuloapplication/pdfapplication/pdfapplication/pdfhttp://hdl.handle.net/11336/84375Argiroffo, Gabriela Rut; Bianchi, Silvia María; Lucarini, Yanina Paola; Wagler, Annegret Katrin; A linear-time algorithm for the identifying code problem on block graphs; Elsevier Science; Electronic Notes in Discrete Mathematics; 62; 11-2017; 249-2541571-0653CONICET DigitalCONICETenginfo:eu-repo/semantics/altIdentifier/url/https://www.sciencedirect.com/science/article/pii/S1571065317302822info:eu-repo/semantics/altIdentifier/doi/10.1016/j.endm.2017.10.043info:eu-repo/semantics/openAccesshttps://creativecommons.org/licenses/by-nc-sa/2.5/ar/reponame:CONICET Digital (CONICET)instname:Consejo Nacional de Investigaciones Científicas y Técnicas2025-09-03T09:51:40Zoai:ri.conicet.gov.ar:11336/84375instacron: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-03 09:51:40.64CONICET Digital (CONICET) - Consejo Nacional de Investigaciones Científicas y Técnicasfalse
dc.title.none.fl_str_mv A linear-time algorithm for the identifying code problem on block graphs
title A linear-time algorithm for the identifying code problem on block graphs
spellingShingle A linear-time algorithm for the identifying code problem on block graphs
Argiroffo, Gabriela Rut
Block Graphs
Computational Complexity
Identifying Codes
title_short A linear-time algorithm for the identifying code problem on block graphs
title_full A linear-time algorithm for the identifying code problem on block graphs
title_fullStr A linear-time algorithm for the identifying code problem on block graphs
title_full_unstemmed A linear-time algorithm for the identifying code problem on block graphs
title_sort A linear-time algorithm for the identifying code problem on block graphs
dc.creator.none.fl_str_mv Argiroffo, Gabriela Rut
Bianchi, Silvia María
Lucarini, Yanina Paola
Wagler, Annegret Katrin
author Argiroffo, Gabriela Rut
author_facet Argiroffo, Gabriela Rut
Bianchi, Silvia María
Lucarini, Yanina Paola
Wagler, Annegret Katrin
author_role author
author2 Bianchi, Silvia María
Lucarini, Yanina Paola
Wagler, Annegret Katrin
author2_role author
author
author
dc.subject.none.fl_str_mv Block Graphs
Computational Complexity
Identifying Codes
topic Block Graphs
Computational Complexity
Identifying Codes
purl_subject.fl_str_mv https://purl.org/becyt/ford/1.1
https://purl.org/becyt/ford/1
dc.description.none.fl_txt_mv The identifying code problem is a special search problem, challenging both from a theoretical and from a computational point of view, even for several graphs where other usually hard problems are easy to solve, like bipartite graphs or chordal graphs. Hence, a typical line of attack for this problem is to determine minimum identifying codes of special graphs. In this work we study the problem of determining the cardinality of a minimum identifying code in block graphs (that are diamond-free chordal graphs). We present a linear-time algorithm for this problem, as a generalization of a linear-time algorithm proposed by Auger in 2010 for the case of trees. Thereby, we provide a subclass of chordal graphs for which the identifying code problem can be solved in linear time.
Fil: Argiroffo, Gabriela Rut. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina. Universidad Nacional de Rosario. Facultad de Ciencias Exactas Ingeniería y Agrimensura. Escuela de Ciencias Exactas y Naturales. Departamento de Matemática; Argentina
Fil: Bianchi, Silvia María. Universidad Nacional de Rosario. Facultad de Ciencias Exactas Ingeniería y Agrimensura. Escuela de Ciencias Exactas y Naturales. Departamento de Matemática; Argentina
Fil: Lucarini, Yanina Paola. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina. Universidad Nacional de Rosario. Facultad de Ciencias Exactas Ingeniería y Agrimensura. Escuela de Ciencias Exactas y Naturales. Departamento de Matemática; Argentina
Fil: Wagler, Annegret Katrin. University Clermont Auvergne; Francia
description The identifying code problem is a special search problem, challenging both from a theoretical and from a computational point of view, even for several graphs where other usually hard problems are easy to solve, like bipartite graphs or chordal graphs. Hence, a typical line of attack for this problem is to determine minimum identifying codes of special graphs. In this work we study the problem of determining the cardinality of a minimum identifying code in block graphs (that are diamond-free chordal graphs). We present a linear-time algorithm for this problem, as a generalization of a linear-time algorithm proposed by Auger in 2010 for the case of trees. Thereby, we provide a subclass of chordal graphs for which the identifying code problem can be solved in linear time.
publishDate 2017
dc.date.none.fl_str_mv 2017-11
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/84375
Argiroffo, Gabriela Rut; Bianchi, Silvia María; Lucarini, Yanina Paola; Wagler, Annegret Katrin; A linear-time algorithm for the identifying code problem on block graphs; Elsevier Science; Electronic Notes in Discrete Mathematics; 62; 11-2017; 249-254
1571-0653
CONICET Digital
CONICET
url http://hdl.handle.net/11336/84375
identifier_str_mv Argiroffo, Gabriela Rut; Bianchi, Silvia María; Lucarini, Yanina Paola; Wagler, Annegret Katrin; A linear-time algorithm for the identifying code problem on block graphs; Elsevier Science; Electronic Notes in Discrete Mathematics; 62; 11-2017; 249-254
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/url/https://www.sciencedirect.com/science/article/pii/S1571065317302822
info:eu-repo/semantics/altIdentifier/doi/10.1016/j.endm.2017.10.043
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
https://creativecommons.org/licenses/by-nc-sa/2.5/ar/
eu_rights_str_mv openAccess
rights_invalid_str_mv https://creativecommons.org/licenses/by-nc-sa/2.5/ar/
dc.format.none.fl_str_mv application/pdf
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_ 1842269109371273216
score 13.13397

Publicaciones similares