Circular-arc graphs with clique cover number two
Journal of Combinatorial Theory Series A
$O(M.N)$ Algorithms for the Recognition and Isomorphism Problems on Circular-Arc Graphs
SIAM Journal on Computing
Circular-arc graph recognition and related problems
Circular-arc graph recognition and related problems
An O(n2 algorithm for circular-arc graph recognition
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Modular decomposition and transitive orientation
Discrete Mathematics - Special issue on partial ordered sets
Linear-Time Representation Algorithms for Proper Circular-Arc Graphs and Proper Interval Graphs
SIAM Journal on Computing
Recognition and Isomorphism of Two Dimensional Partial Orders
Proceedings of the 10th Colloquium on Automata, Languages and Programming
Avoiding Matrix Multiplication
WG '90 Proceedings of the 16rd International Workshop on Graph-Theoretic Concepts in Computer Science
PC trees and circular-ones arrangements
Theoretical Computer Science - Computing and combinatorics
Efficient construction of unit circular-arc models
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Routing in all-optical ring networks revisited
ISCC '04 Proceedings of the Ninth International Symposium on Computers and Communications 2004 Volume 2 (ISCC"04) - Volume 02
Combinatorial auctions with structured item graphs
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Journal of Computer and System Sciences
Intersection representations of matrices by subtrees and unicycles on graphs
Journal of Discrete Algorithms
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
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
Interval graphs: canonical representation in logspace
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
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
Characterizations and linear time recognition of helly circular-arc graphs
COCOON'06 Proceedings of the 12th annual international conference on Computing and Combinatorics
Coloring fuzzy circular interval graphs
European Journal of Combinatorics
| Hi-index | 0.00 |
We give a linear time recognition algorithm for circular-arc graphs. Our algorithm is much simpler than the linear time recognition algorithm of McConnell [10] (which is the only linear time recognition algorithm previously known). Our algorithm is a new and careful implementation of the algorithm of Eschen and Spinrad [4, 5]. We also tighten the analysis of Eschen and Spinrad