Certifying algorithms for recognizing interval graphs and permutation graphs

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2003, Pages 158-167

  Kratsch, Dieter ^a   McConnell, Ross M ^b   Mehlhorn, Kurt ^c   Spinrad, Jeremy P ^d  

^a UNIVERSITÉ DE LORRAINE   (France)

^b University Services Building   (United States)

^c MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^d VANDERBILT UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; COMPUTER SOFTWARE; GRAPH THEORY; LINEAR SYSTEMS; MATHEMATICAL MODELS; THEOREM PROVING; TOPOLOGY;

CERTIFYING ALGORITHM; LINEAR TIME CERTIFYING ALGORITHM; PERMUTATION GRAPH;

ALGORITHMS;

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

References (17)

1. K. S. Booth and G. S. Lueker, Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms, JCSS, 13 (1976), pp. 335-379.
2. A. Brandstädt and V. B. Le and J. P. Spinrad, Graph Classes: A Survey, SIAM Monographs on Discrete Mathematics and Applications, 1999.
3. D. G. Corneil, S. Olariu, and L. Stewart, The ultimate interval graph recognition algorithm? Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 9 (1998), pp. 175-180.
4. G. A. Dirac, On rigid circuit graphs, Abh. Math. Sem. Univ. Hamburg, 25 (1961) pp. 71-76.
5. T. Gallai, Transitiv orientierbare Graphen, Acta Math. Acad. Sci. Hungar., 18 (1967), pp. 25-66.
6. M. C. Golumbic, Algorithmic Graph Theory and Perfect Graphs, Academic Press, 1980.
7. M. Habib, R. M. McConnell, C. Paul, and L. Viennot, Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing, Theoretical Computer Science, 234 (2000), pp. 59-84.
8. W. L. Hsu, A simple test for interval graphs, Lecture Notes in Computer Science, 657 (1993), pp. 11-16.
9. W. L. Hsu and R. M. McConnell, PC Trees and Circular-Ones Arrangements, Theoretical Computer Science, to appear.
10. N. Korte and R. H. Möhring, An incremental linear-time algorithm for recognizing interval graphs, SIAM Journal on Computing, 18 (1989), pp. 68-81.
11. C. Lekkerkerker and D. Boland, Representation of finite graphs by a set of intervals on the real line, Fund. Math. 51 (1962), 45-64.
12. R. M. McConnell and J. P. Spinrad, Modular decomposition and transitive orientation, Discrete Mathematics, 201 (1999), pp. 189-241.
13. K. Mehlhorn and S. Näher, The LEDA Platform for Combinatorial and Geometric Computing, Cambridge University Press, 1999.
14. A. Pnueli, A. Lempel and S. Even, Transitive orientation of graphs and identification of permutation graphs, Canad. J. Math., 23 (1971), pp. 160-175.
15. D. J. Rose, R. E. Tarjan, and G. S. Lueker, Algorithmic aspects of vertex elimination on graphs, SIAM J. Comput., 5 (1976), pp. 266-283.
16. R. E. Tarjan and M. Yannakakis, Addendum: simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs, SIAM J. Comput., 14 (1985), pp. 254-255.
17. H. Wasserman and M. Blum, Software reliability via run-time result-checking, JACM, 44 (1997), pp. 826-849.