Linear-time recognition of circular-arc graphs

Annual Symposium on Foundations of Computer Science - Proceedings

Volumn , Issue , 2001, Pages 386-394

  McConnell, R M ^a  

^a Anschutz Medical Campus   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; PROBLEM SOLVING; SET THEORY;

CIRCULAR-ARC GRAPHS;

GRAPH THEORY;

EID: 0035175949     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/sfcs.2001.959913     Document Type: Conference Paper

References (22)

1. On the topology of the genetic tine structure
2. Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
3. Theory of 2-structures, part 1: Clans, basic subclasses, and morphisms
4. Theory of 2-structures, part 2: Representations through labeled tree families
5. 2) algorithm for circularare graph recognition
6. Incidence matrices and interval graphs
7. Transitiv orientierbare Graphen
8. O(mn) algorithms for the recognition and isomorphism problems on circular-arc graphs
9. A polynomial time recognition algorithm for probe interval graphs
10. Sur deux proprietés des classes d'ensembles
11. Modular decomposition and transitive orientation
12. Algorithmic aspects of comparability graphs and interval graphs
13. Algorithmic aspects of the substitution decomposition in optimization over relations, set systems and boolean functions
14. Substitution decomposition for discrete structures and connections with combinatorial optimization
15. Doubly lexical ordering of dense 0-1 matrices
16. An efficient test for circular-arc graphs