A Simple Linear Time Algorithm for the Isomorphism Problem on Proper Circular-Arc Graphs

MIN CHIH LIN; FRANCISCO J. SOULIGNAC; JAYME L. SZWARCFITER

LECTURE NOTES IN COMPUTER SCIENCE

Springer

Lugar: Berlin; Año: 2008 vol. 5124 p. 355 - 366

0302-9743

A circular-arc model $mathcal {M} =(C,mathcal{A})$ is a circle $C$ together with a collection $mathcal{A}$ of arcs of $C$. If no arc is contained in any other then $mathcal{M}$ is a proper circular-arc model, and if some point of $C$ is not covered by any arc then $M$ is an interval model.  A (proper) (interval) circular-arc graph is the intersection graph of a (proper) (interval) circular-arc model. Circular-arc graphs and their subclasses have been the object of a great deal of attention in the literature. Linear time recognition algorithms have been described both for the general class and for some of its subclasses.  For the isomorphism problem, there exists a polynomial time algorithm for the general case, and a linear time algorithm for interval graphs.  In this work we develop a linear time algorithm for the isomorphism problem in proper circular-arc graphs, based on uniquely encoding a proper circular-arc model. Our method relies on results about uniqueness of certain PCA models, developed by Deng, Hell and Huang in [6]. The algorithm is easy to code and uses only basic tools available in almost every programming language.