A certifying algorithm for the consecutive-ones property

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 15, Issue , 2004, Pages 761-770

  McConnell, Ross M ^a  

^a Department of Environmental and Radiological Health Sciences   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; LINEAR PROGRAMMING; MAPS; MATRIX ALGEBRA; OPTIMIZATION; PROBLEM SOLVING; THEOREM PROVING; TREES (MATHEMATICS);

CONSECUTIVE-ONES PROPERTY; FORBIDDEN SUBSTRUCTURES;

SET THEORY;

EID: 1842591771     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (17)

1. S. Booth and G. S. Lueker, Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms, J. Comput. Syst. Sci., 13 (1976), pp. 335-379.
2. A. Brandstaedt and V. B. Le and J. P. Spinrad, Graph Classes: A Survey, SIAM Monographs on Discrete Mathematics, Philadelphia, 1999.
3. M. Chein and M. Habib and M. G. Maurer, Partitive hypergraphs, Discrete Mathematics, 37 (1981) pp. 3550.
4. T. H. Cormen and C. E. Leiserson and R. L. Rivest and C. Stein, Introduction to Algorithms, McGraw Hill, Boston, 2001.
5. E. Dahlhaus, Parallel algorithms for hierarchical clustering, and applications to split decomposition and parity graph recognition, Journal of Algorithms, 36 (2000) pp. 205-240.
6. T. Gallai, Transitiv orientierbare Graphen, Acta Math. Acad. Sci. Hungar., 18, (1967), pp. 25-66.
7. M. C. Golumbic, Algorithmic Graph Theory and Perfect Graphs, Academic Press, New York, 1980.
8. W. L. Hsu and R. M. McConnell, PC trees and circular-ones arrangements, Theoretical Computer Science, 296 (2003), pp. 59-74.
9. D. Kratsch and R. M. McConnell and K. Mehlhorn and J. P. Spinrad, Certifying algorithms for recognizing interval graphs and permutation graphs, ACM-SIAM SODA, 14 (2003), pp. 866-875.
10. A. Lempel and S. Even and I. Cederbaum, An algorithm for planarity testing of graphs, in Theory of Graphs, P. Rosenstiehl (ed.), Gordon and Breach, New York, 1967.
11. R. M. McConnell and J. P. Spinrad, Linear-time modular decomposition and efficient transitive orientation of comparability graphs, ACM-SIAM SODA, 5 (1994), pp. 536-545.
12. R. M. McConnell and J. P. Spinrad, Modular decomposition and transitive orientation, Discrete Mathematics, 201 (1999), pp. 189-241.
13. T. A. McKee and F. R. McMorris, Topics in Intersection Graph Theory, SIAM, Philadelphia, 1999.
14. K. Mehlhorn and S. Näeher, The LEDA Platform for Combinatorial and Geometric Computing, Cambridge University Press, Cambridge", 1999.
15. R. H. Möhring, R. H., Algorithmic aspects of the substitution decomposition in optimization over relations, set systems and Boolean functions, Annals of Operations Research, 4 (1985), pp. 195-225.
16. A. Tucker, A structure theorem for the consecutive 1's property, J. Comb. Th. (B), 12 (1972), pp. 153-162.
17. H. Wasserman and M. Blum, Software reliability via run-time result-checking, J. ACM, 44 (1997), pp. 826-849.