Linear-Time Recognition of Circular-Arc Graphs (2003)
Cached
Download Links
- [www.cs.colostate.edu]
- [carbon.cudenver.edu]
- [carbon.cudenver.edu]
- [www.cs.colostate.edu]
- [carbon.cudenver.edu]
- [www.cs.colostate.edu]
- DBLP
Other Repositories/Bibliography
by
Ross M. McConnell
| Venue: | Algorithmica |
| Citations: | 26 - 5 self |
BibTeX
@MISC{McConnell03linear-timerecognition,
author = {Ross M. McConnell},
title = {Linear-Time Recognition of Circular-Arc Graphs },
year = {2003}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
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.
