LEDA: a platform for combinatorial and geometric computing
LEDA: a platform for combinatorial and geometric computing
Linear-Time Representation Algorithms for Proper Circular-Arc Graphs and Proper Interval Graphs
SIAM Journal on Computing
A certifying algorithm for the consecutive-ones property
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Certifying LexBFS Recognition Algorithms for Proper Interval Graphs and Proper Interval Bigraphs
SIAM Journal on Discrete Mathematics
Efficient construction of unit circular-arc models
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Certifying Algorithms for Recognizing Interval Graphs and Permutation Graphs
SIAM Journal on Computing
Interval bigraphs and circular arc graphs
Journal of Graph Theory
Discrete Applied Mathematics
Polynomial time recognition of unit circular-arc graphs
Journal of Algorithms
A simpler linear-time recognition of circular-arc graphs
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
A Simple Linear Time Algorithm for the Isomorphism Problem on Proper Circular-Arc Graphs
SWAT '08 Proceedings of the 11th Scandinavian workshop on Algorithm Theory
From a Circular-Arc Model to a Proper Circular-Arc Model
Graph-Theoretic Concepts in Computer Science
Linear-time certifying recognition algorithms and forbidden induced subgraphs
Nordic Journal of Computing
Certifying algorithms for recognizing proper circular-arc graphs and unit circular-arc graphs
Discrete Applied Mathematics
Proper Helly circular-arc graphs
WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science
The clique operator on circular-arc graphs
Discrete Applied Mathematics
Powers of cycles, powers of paths, and distance graphs
Discrete Applied Mathematics
Computer Science Review
| Hi-index | 0.00 |
We give two new algorithms for recognizing proper circular-arc graphs and unit circular-arc graphs. The algorithms either provide a model for the input graph, or a certificate that proves that such a model does not exist and can be authenticated in O(n) time.