Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms

Journal of Computer and System Sciences

Volumn 13, Issue 3, 1976, Pages 335-379

  Booth, Kellogg S ^a   Lueker, George S ^b  

^a LAWRENCE LIVERMORE NATIONAL LABORATORY   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING - SUBROUTINES; MATHEMATICAL TECHNIQUES - TREES;

DATA PROCESSING;

EID: 0017216776     PISSN: 00220000     EISSN: 10902724     Source Type: Journal    
DOI: 10.1016/S0022-0000(76)80045-1     Document Type: Article

References (31)

1. On the topology of the genetic fine structure
2. PQ-tree algorithms
3. Optimal scheduling for two-processor systems
4. On rigid circuit graphs
5. Incidence matrices and interval graphs
6. An algorithm for testing chordality of graphs
7. File organization the consecutive retrieval property
8. A characterization of comparability graphs and of interval graphs
9. On the complexity of computing graph isomorphism
10. Über eine art von graphen
11. Efficient planarity testing
12. Incidence matrices interval graphs and seriation in archaeology
13. Sur le problème des courbes gauches en topologie
14. Representation of a finite graph by a set of intervals on the real line
15. An algorithm for planarity testing of graphs
16. Efficient algorithms for chordal graphs and interval graphs
17. Triangulated graphs and the elimination process
18. Algorithmic aspects of vertex elimination on graphs
19. Combinatorial configurations
20. Scheduling graphs on two processors
21. Scheduling of traffic lights—a new approach
22. Gaussian elimination is not optimal
23. Matrix characterizations of circular-arc graphs
24. A structure theorem for the consecutive 1's property