Isomorphism of graph classes related to the circular-ones property

Autores
Curtis, Andrew R.; Lin, Min Chih; McConnell, Ross M.; Nussbaum, Yahav; Soulignac, Francisco Juan; Spinrad, Jeremy P.; Szwarcfiter, Jayme L.
Año de publicación
2013
Idioma
inglés
Tipo de recurso
artículo
Estado
versión publicada
Descripción
We give a linear-time algorithm that checks for isomorphism between two 0-1 matrices that obey the circular-ones property. Our algorithm is similar to the isomorphism algorithm for interval graphs of Lueker and Booth, but works on PC trees, which are unrooted and have a cyclic nature, rather than with PQ trees, which are rooted. This algorithm leads to linear-time isomorphism algorithms for related graph classes, including Helly circular-arc graphs, $Gamma$ circular-arc graphs, proper circular-arc graphs and convex-round graphs.
Fil: Curtis, Andrew R.. University of Waterloo; Canadá
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: McConnell, Ross M.. State University of Colorado - Fort Collins; Estados Unidos
Fil: Nussbaum, Yahav. Tel Aviv University; Israel
Fil: Soulignac, Francisco Juan. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación; Argentina
Fil: Spinrad, Jeremy P.. Vanderbilt University; Estados Unidos
Fil: Szwarcfiter, Jayme L.. Universidade Federal do Rio de Janeiro; Brasil
Materia
circular-ones property
matrix isomorphism
circular-arc graphs
graph isomorphism
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/84528
Acceder
id CONICETDig_9195db07a7e5259fe41652c95d459bbc
oai_identifier_str oai:ri.conicet.gov.ar:11336/84528
network_acronym_str CONICETDig
repository_id_str 3498
network_name_str CONICET Digital (CONICET)
spelling Isomorphism of graph classes related to the circular-ones propertyCurtis, Andrew R.Lin, Min ChihMcConnell, Ross M.Nussbaum, YahavSoulignac, Francisco JuanSpinrad, Jeremy P.Szwarcfiter, Jayme L.circular-ones propertymatrix isomorphismcircular-arc graphsgraph isomorphismhttps://purl.org/becyt/ford/1.2https://purl.org/becyt/ford/1https://purl.org/becyt/ford/1.1https://purl.org/becyt/ford/1We give a linear-time algorithm that checks for isomorphism between two 0-1 matrices that obey the circular-ones property. Our algorithm is similar to the isomorphism algorithm for interval graphs of Lueker and Booth, but works on PC trees, which are unrooted and have a cyclic nature, rather than with PQ trees, which are rooted. This algorithm leads to linear-time isomorphism algorithms for related graph classes, including Helly circular-arc graphs, $Gamma$ circular-arc graphs, proper circular-arc graphs and convex-round graphs.Fil: Curtis, Andrew R.. University of Waterloo; Canadá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: McConnell, Ross M.. State University of Colorado - Fort Collins; Estados UnidosFil: Nussbaum, Yahav. Tel Aviv University; IsraelFil: Soulignac, Francisco Juan. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación; ArgentinaFil: Spinrad, Jeremy P.. Vanderbilt University; Estados UnidosFil: Szwarcfiter, Jayme L.. Universidade Federal do Rio de Janeiro; BrasilDiscrete Mathematics and Theoretical Computer Science2013-03info: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/84528Curtis, Andrew R.; Lin, Min Chih; McConnell, Ross M.; Nussbaum, Yahav; Soulignac, Francisco Juan; et al.; Isomorphism of graph classes related to the circular-ones property; Discrete Mathematics and Theoretical Computer Science; Discrete Mathematics and Theoretical Computer Science; 15; 1; 3-2013; 157-1821365-8050CONICET DigitalCONICETenginfo:eu-repo/semantics/altIdentifier/url/https://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/2298.1.htmlinfo:eu-repo/semantics/altIdentifier/url/https://arxiv.org/abs/1203.4822info: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-29T09:58:32Zoai:ri.conicet.gov.ar:11336/84528instacron: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-29 09:58:32.94CONICET Digital (CONICET) - Consejo Nacional de Investigaciones Científicas y Técnicasfalse
dc.title.none.fl_str_mv Isomorphism of graph classes related to the circular-ones property
title Isomorphism of graph classes related to the circular-ones property
spellingShingle Isomorphism of graph classes related to the circular-ones property
Curtis, Andrew R.
circular-ones property
matrix isomorphism
circular-arc graphs
graph isomorphism
title_short Isomorphism of graph classes related to the circular-ones property
title_full Isomorphism of graph classes related to the circular-ones property
title_fullStr Isomorphism of graph classes related to the circular-ones property
title_full_unstemmed Isomorphism of graph classes related to the circular-ones property
title_sort Isomorphism of graph classes related to the circular-ones property
dc.creator.none.fl_str_mv Curtis, Andrew R.
Lin, Min Chih
McConnell, Ross M.
Nussbaum, Yahav
Soulignac, Francisco Juan
Spinrad, Jeremy P.
Szwarcfiter, Jayme L.
author Curtis, Andrew R.
author_facet Curtis, Andrew R.
Lin, Min Chih
McConnell, Ross M.
Nussbaum, Yahav
Soulignac, Francisco Juan
Spinrad, Jeremy P.
Szwarcfiter, Jayme L.
author_role author
author2 Lin, Min Chih
McConnell, Ross M.
Nussbaum, Yahav
Soulignac, Francisco Juan
Spinrad, Jeremy P.
Szwarcfiter, Jayme L.
author2_role author
author
author
author
author
author
dc.subject.none.fl_str_mv circular-ones property
matrix isomorphism
circular-arc graphs
graph isomorphism
topic circular-ones property
matrix isomorphism
circular-arc graphs
graph isomorphism
purl_subject.fl_str_mv https://purl.org/becyt/ford/1.2
https://purl.org/becyt/ford/1
https://purl.org/becyt/ford/1.1
https://purl.org/becyt/ford/1
dc.description.none.fl_txt_mv We give a linear-time algorithm that checks for isomorphism between two 0-1 matrices that obey the circular-ones property. Our algorithm is similar to the isomorphism algorithm for interval graphs of Lueker and Booth, but works on PC trees, which are unrooted and have a cyclic nature, rather than with PQ trees, which are rooted. This algorithm leads to linear-time isomorphism algorithms for related graph classes, including Helly circular-arc graphs, $Gamma$ circular-arc graphs, proper circular-arc graphs and convex-round graphs.
Fil: Curtis, Andrew R.. University of Waterloo; Canadá
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: McConnell, Ross M.. State University of Colorado - Fort Collins; Estados Unidos
Fil: Nussbaum, Yahav. Tel Aviv University; Israel
Fil: Soulignac, Francisco Juan. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación; Argentina
Fil: Spinrad, Jeremy P.. Vanderbilt University; Estados Unidos
Fil: Szwarcfiter, Jayme L.. Universidade Federal do Rio de Janeiro; Brasil
description We give a linear-time algorithm that checks for isomorphism between two 0-1 matrices that obey the circular-ones property. Our algorithm is similar to the isomorphism algorithm for interval graphs of Lueker and Booth, but works on PC trees, which are unrooted and have a cyclic nature, rather than with PQ trees, which are rooted. This algorithm leads to linear-time isomorphism algorithms for related graph classes, including Helly circular-arc graphs, $Gamma$ circular-arc graphs, proper circular-arc graphs and convex-round graphs.
publishDate 2013
dc.date.none.fl_str_mv 2013-03
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/84528
Curtis, Andrew R.; Lin, Min Chih; McConnell, Ross M.; Nussbaum, Yahav; Soulignac, Francisco Juan; et al.; Isomorphism of graph classes related to the circular-ones property; Discrete Mathematics and Theoretical Computer Science; Discrete Mathematics and Theoretical Computer Science; 15; 1; 3-2013; 157-182
1365-8050
CONICET Digital
CONICET
url http://hdl.handle.net/11336/84528
identifier_str_mv Curtis, Andrew R.; Lin, Min Chih; McConnell, Ross M.; Nussbaum, Yahav; Soulignac, Francisco Juan; et al.; Isomorphism of graph classes related to the circular-ones property; Discrete Mathematics and Theoretical Computer Science; Discrete Mathematics and Theoretical Computer Science; 15; 1; 3-2013; 157-182
1365-8050
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.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/2298.1.html
info:eu-repo/semantics/altIdentifier/url/https://arxiv.org/abs/1203.4822
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 Discrete Mathematics and Theoretical Computer Science
publisher.none.fl_str_mv Discrete Mathematics and Theoretical Computer 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_ 1844613744005480448
score 13.070432

Publicaciones similares