A certifying and dynamic algorithm for the recognition of proper circular-arc graphs

Autores
Soulignac, Francisco Juan
Año de publicación
2021
Idioma
inglés
Tipo de recurso
artículo
Estado
versión publicada
Descripción
We present a dynamic algorithm for the recognition of proper circular-arc (PCA) graphs, that supports the insertion and removal of vertices (together with its incident edges). The main feature of the algorithm is that it outputs a minimally non-PCA induced subgraph when the insertion of a vertex fails. Each operation cost O(log⁡n+d) time, where n is the number vertices and d is the degree of the modified vertex. When removals are disallowed, each insertion is processed in O(d) time. The algorithm also provides two constant-time operations to query if the dynamic graph is proper Helly (PHCA) or proper interval (PIG). When the dynamic graph is not PHCA (resp. PIG), a minimally non-PHCA (resp. non-PIG) induced subgraph is obtained.
Fil: Soulignac, Francisco Juan. Consejo Nacional de Investigaciones Científicas y Técnicas. Oficina de Coordinación Administrativa Ciudad Universitaria. Instituto de Investigación en Ciencias de la Computación; Argentina
Materia
CERTIFYING ALGORITHM
DYNAMIC REPRESENTATION
PROPER CIRCULAR-ARC GRAPHS
PROPER HELLY CIRCULAR-ARC GRAPHS
PROPER INTERVAL GRAPH
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/173301
Acceder
id CONICETDig_b6fac39702ca7b36f80083c6d080dcb9
oai_identifier_str oai:ri.conicet.gov.ar:11336/173301
network_acronym_str CONICETDig
repository_id_str 3498
network_name_str CONICET Digital (CONICET)
spelling A certifying and dynamic algorithm for the recognition of proper circular-arc graphsSoulignac, Francisco JuanCERTIFYING ALGORITHMDYNAMIC REPRESENTATIONPROPER CIRCULAR-ARC GRAPHSPROPER HELLY CIRCULAR-ARC GRAPHSPROPER INTERVAL GRAPHhttps://purl.org/becyt/ford/1.2https://purl.org/becyt/ford/1We present a dynamic algorithm for the recognition of proper circular-arc (PCA) graphs, that supports the insertion and removal of vertices (together with its incident edges). The main feature of the algorithm is that it outputs a minimally non-PCA induced subgraph when the insertion of a vertex fails. Each operation cost O(log⁡n+d) time, where n is the number vertices and d is the degree of the modified vertex. When removals are disallowed, each insertion is processed in O(d) time. The algorithm also provides two constant-time operations to query if the dynamic graph is proper Helly (PHCA) or proper interval (PIG). When the dynamic graph is not PHCA (resp. PIG), a minimally non-PHCA (resp. non-PIG) induced subgraph is obtained.Fil: Soulignac, Francisco Juan. Consejo Nacional de Investigaciones Científicas y Técnicas. Oficina de Coordinación Administrativa Ciudad Universitaria. Instituto de Investigación en Ciencias de la Computación; ArgentinaElsevier Science2021-10info: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/173301Soulignac, Francisco Juan; A certifying and dynamic algorithm for the recognition of proper circular-arc graphs; Elsevier Science; Theoretical Computer Science; 889; 10-2021; 105-1340304-3975CONICET DigitalCONICETenginfo:eu-repo/semantics/altIdentifier/doi/10.1016/j.tcs.2021.07.040info:eu-repo/semantics/altIdentifier/url/https://arxiv.org/abs/1509.05828info: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:46:44Zoai:ri.conicet.gov.ar:11336/173301instacron: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:46:44.795CONICET Digital (CONICET) - Consejo Nacional de Investigaciones Científicas y Técnicasfalse
dc.title.none.fl_str_mv A certifying and dynamic algorithm for the recognition of proper circular-arc graphs
title A certifying and dynamic algorithm for the recognition of proper circular-arc graphs
spellingShingle A certifying and dynamic algorithm for the recognition of proper circular-arc graphs
Soulignac, Francisco Juan
CERTIFYING ALGORITHM
DYNAMIC REPRESENTATION
PROPER CIRCULAR-ARC GRAPHS
PROPER HELLY CIRCULAR-ARC GRAPHS
PROPER INTERVAL GRAPH
title_short A certifying and dynamic algorithm for the recognition of proper circular-arc graphs
title_full A certifying and dynamic algorithm for the recognition of proper circular-arc graphs
title_fullStr A certifying and dynamic algorithm for the recognition of proper circular-arc graphs
title_full_unstemmed A certifying and dynamic algorithm for the recognition of proper circular-arc graphs
title_sort A certifying and dynamic algorithm for the recognition of proper circular-arc graphs
dc.creator.none.fl_str_mv Soulignac, Francisco Juan
author Soulignac, Francisco Juan
author_facet Soulignac, Francisco Juan
author_role author
dc.subject.none.fl_str_mv CERTIFYING ALGORITHM
DYNAMIC REPRESENTATION
PROPER CIRCULAR-ARC GRAPHS
PROPER HELLY CIRCULAR-ARC GRAPHS
PROPER INTERVAL GRAPH
topic CERTIFYING ALGORITHM
DYNAMIC REPRESENTATION
PROPER CIRCULAR-ARC GRAPHS
PROPER HELLY CIRCULAR-ARC GRAPHS
PROPER INTERVAL GRAPH
purl_subject.fl_str_mv https://purl.org/becyt/ford/1.2
https://purl.org/becyt/ford/1
dc.description.none.fl_txt_mv We present a dynamic algorithm for the recognition of proper circular-arc (PCA) graphs, that supports the insertion and removal of vertices (together with its incident edges). The main feature of the algorithm is that it outputs a minimally non-PCA induced subgraph when the insertion of a vertex fails. Each operation cost O(log⁡n+d) time, where n is the number vertices and d is the degree of the modified vertex. When removals are disallowed, each insertion is processed in O(d) time. The algorithm also provides two constant-time operations to query if the dynamic graph is proper Helly (PHCA) or proper interval (PIG). When the dynamic graph is not PHCA (resp. PIG), a minimally non-PHCA (resp. non-PIG) induced subgraph is obtained.
Fil: Soulignac, Francisco Juan. Consejo Nacional de Investigaciones Científicas y Técnicas. Oficina de Coordinación Administrativa Ciudad Universitaria. Instituto de Investigación en Ciencias de la Computación; Argentina
description We present a dynamic algorithm for the recognition of proper circular-arc (PCA) graphs, that supports the insertion and removal of vertices (together with its incident edges). The main feature of the algorithm is that it outputs a minimally non-PCA induced subgraph when the insertion of a vertex fails. Each operation cost O(log⁡n+d) time, where n is the number vertices and d is the degree of the modified vertex. When removals are disallowed, each insertion is processed in O(d) time. The algorithm also provides two constant-time operations to query if the dynamic graph is proper Helly (PHCA) or proper interval (PIG). When the dynamic graph is not PHCA (resp. PIG), a minimally non-PHCA (resp. non-PIG) induced subgraph is obtained.
publishDate 2021
dc.date.none.fl_str_mv 2021-10
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/173301
Soulignac, Francisco Juan; A certifying and dynamic algorithm for the recognition of proper circular-arc graphs; Elsevier Science; Theoretical Computer Science; 889; 10-2021; 105-134
0304-3975
CONICET Digital
CONICET
url http://hdl.handle.net/11336/173301
identifier_str_mv Soulignac, Francisco Juan; A certifying and dynamic algorithm for the recognition of proper circular-arc graphs; Elsevier Science; Theoretical Computer Science; 889; 10-2021; 105-134
0304-3975
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.tcs.2021.07.040
info:eu-repo/semantics/altIdentifier/url/https://arxiv.org/abs/1509.05828
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
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_ 1842268813069910016
score 13.13397

Publicaciones similares