An optimal algorithm for finding a maximum independent set of a circular-arc graph
SIAM Journal on Computing
Stability in circular arc graphs
Journal of Algorithms
An O(n1.5) algorithm to color proper circular arcs
Discrete Applied Mathematics
Linear time algorithms on circular-arc graphs
Information Processing Letters
$O(M.N)$ Algorithms for the Recognition and Isomorphism Problems on Circular-Arc Graphs
SIAM Journal on Computing
Linear-Time Representation Algorithms for Proper Circular-Arc Graphs and Proper Interval Graphs
SIAM Journal on Computing
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
Efficient construction of unit circular-arc models
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Proper Helly circular-arc graphs
WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science
Certifying algorithms for recognizing proper circular-arc graphs and unit circular-arc graphs
WG'06 Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science
A simpler linear-time recognition of circular-arc graphs
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
Normal Helly circular-arc graphs and its subclasses
Discrete Applied Mathematics
| Hi-index | 0.00 |
We are given a circular-arc graph, represented by a circular-arc model; our goal is to decide whether the graph is a proper circular-arc graph. We do so in time linear in the number of vertices of the graph, regardless of the number of edges which may be quadratic in the number of vertices. For every input graph, we either provide a proper circular-arc model for the graph, or a forbidden subgraph induced in the graph.