Maximum weight clique algorithms for circular-arc graphs and circle graphs
SIAM Journal on Computing
Journal of Combinatorial Theory Series B
Digraph decompositions and Eulerian systems
SIAM Journal on Algebraic and Discrete Methods
Reducing prime graphs and recognizing circle graphs
Combinatorica
Circle graphs
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
Complexity and algorithms for reasoning about time: a graph-theoretic approach
Journal of the ACM (JACM)
Split decomposition of undirected graphs
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
The interlace polynomial: a new graph polynomial
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Temporal Constraints: A Survey
Constraints
A Coarse-Grained Parallel Algorithm for Maximal Cliques in Circle Graphs
ICCS '01 Proceedings of the International Conference on Computational Science-Part II
The Complexity of Constraints on Intervals and Lengths
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
The interlace polynomial of a graph
Journal of Combinatorial Theory Series B - Special issue dedicated to professor W. T. Tutte
APX-hardness of domination problems in circle graphs
Information Processing Letters
On the structure of certain intersection graphs
Information Processing Letters
Solving some NP-complete problems using split decomposition
Discrete Applied Mathematics
O(m logn) Split Decomposition of Strongly Connected Graphs
Graph Theory, Computational Intelligence and Thought
APX-hardness of domination problems in circle graphs
Information Processing Letters
O(mlogn) split decomposition of strongly-connected graphs
Discrete Applied Mathematics
NLC-2 graph recognition and isomorphism
WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science
Algorithms and complexity for reasoning about time
AAAI'92 Proceedings of the tenth national conference on Artificial intelligence
Using split composition to extend distance-hereditary graphs in a generative way
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
A generic approach to decomposition algorithms, with an application to digraph decomposition
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
Counting hexagonal patches and independent sets in circle graphs
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
Tree-representation of set families and applications to combinatorial decompositions
European Journal of Combinatorics
Coloring a graph using split decomposition
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
Structural results on circular-arc graphs and circle graphs: A survey and the main open problems
Discrete Applied Mathematics
| Hi-index | 0.01 |
The main result of this paper is an 0([V] x [E]) time algorithm for deciding whether a given graph is a circle graph, that is, the intersection graph of a set of chords on a circle. The algorithm utilizes two new graph-theoretic results, regarding necessary induced subgraphs of graphs having neither articulation points nor similar pairs of vertices. Furthermore, as a substep of the algorithm, it is shown how to find in 0([V] x [E]) time a decomposition of a graph into prime graphs, thereby improving on a result of Cunningham.