Linear-Time Recognition of Circular-Arc Graphs


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… (More)
DOI: 10.1007/s00453-003-1032-7


13 Figures and Tables

Cite this paper

@article{McConnell2001LinearTimeRO, title={Linear-Time Recognition of Circular-Arc Graphs}, author={Ross M. McConnell}, journal={Algorithmica}, year={2001}, volume={37}, pages={93-147} }