$O(M.N)$ Algorithms for the Recognition and Isomorphism Problems on Circular-Arc Graphs
SIAM Journal on Computing
An O(n2 algorithm for circular-arc graph recognition
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Linear-Time Representation Algorithms for Proper Circular-Arc Graphs and Proper Interval Graphs
SIAM Journal on Computing
From a Circular-Arc Model to a Proper Circular-Arc Model
Graph-Theoretic Concepts in Computer Science
Proper Helly circular-arc graphs
WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science
Certifying algorithms for recognizing proper circular-arc graphs and unit circular-arc graphs
WG'06 Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science
A simpler linear-time recognition of circular-arc graphs
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
Characterizations and linear time recognition of helly circular-arc graphs
COCOON'06 Proceedings of the 12th annual international conference on Computing and Combinatorics
Structural results on circular-arc graphs and circle graphs: A survey and the main open problems
Discrete Applied Mathematics
Hi-index | 0.01 |
In a recent paper, Durán, Gravano, McConnell, Spinrad and Tucker described an algorithm of complexity O(n2) for recognizing whether a graph G with n vertices is a unit circular-arc (UCA) graph. Furthermore the following open questions were posed in the above paper: (i) Is it possible to construct a UCA model for G in polynomial time? (ii) Is it possible to construct a model, whose extremes of the arcs correspond to integers of polynomial size? (iii) If (ii) is true, could such a model be constructed in polynomial time? In the present paper, we describe a characterization of UCA graphs which leads to linear time algorithms for recognizing UCA graphs and constructing UCA models. Furthermore, we construct models whose extreme of the arcs correspond to integers of size O(n). The proposed algorithms provide positive answers to the three above questions.