Algorithmica

, Volume 37, Issue 2, pp 93–147 | Cite as

Linear-Time Recognition of Circular-Arc Graphs

Article

Abstract

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.

Circular graph Interval graph Transitive orientation 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag 2003

Authors and Affiliations

  1. 1.Department of Computer Science, Colorado State University, Fort Collins, CO 80523-1873USA

Personalised recommendations