Linear-Time Recognition of Circular-Arc Graphs
- First Online:
- Cite this article as:
- McConnell, R. Algorithmica (2003) 37: 93. doi:10.1007/s00453-003-1032-7
- 197 Downloads
A graph G is a circular-arc graph if it is the intersection graph of a set of arcs on a circle. That is, there is one arc for each vertex of G, and two vertices are adjacent in G if and only if the corresponding arcs intersect. We give a linear-time algorithm for recognizing this class of graphs. When G is a member of the class, the algorithm gives a certificate in the form of a set of arcs that realize it.