Construction of probe interval models
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
PC trees and circular-ones arrangements
Theoretical Computer Science - Computing and combinatorics
Journal of Computer and System Sciences - STOC 2001
On the structure of certain intersection graphs
Information Processing Letters
2-tree probe interval graphs have a large obstruction set
Discrete Applied Mathematics - Special issue: Max-algebra
Discrete Applied Mathematics
On compact and efficient routing in certain graph classes
Discrete Applied Mathematics
Intersection representations of matrices by subtrees and unicycles on graphs
Journal of Discrete Algorithms
2-Tree probe interval graphs have a large obstruction set
Discrete Applied Mathematics
Proper Helly circular-arc graphs
WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science
Algebraic operations on PQ trees and modular decomposition trees
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
| Hi-index | 0.00 |
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 the corresponding arcs intersect. We give a linear time bound 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.