On the Isomorphism Problem for Helly Circular-Arc Graphs
Computational Complexity
2017-04-20 v2 Discrete Mathematics
Combinatorics
Abstract
The isomorphism problem is known to be efficiently solvable for interval graphs, while for the larger class of circular-arc graphs its complexity status stays open. We consider the intermediate class of intersection graphs for families of circular arcs that satisfy the Helly property. We solve the isomorphism problem for this class in logarithmic space. If an input graph has a Helly circular-arc model, our algorithm constructs it canonically, which means that the models constructed for isomorphic graphs are equal.
Cite
@article{arxiv.1402.4642,
title = {On the Isomorphism Problem for Helly Circular-Arc Graphs},
author = {Johannes Köbler and Sebastian Kuhnert and Oleg Verbitsky},
journal= {arXiv preprint arXiv:1402.4642},
year = {2017}
}
Comments
22 pages, 5 figures. Section 5 is revised in this version