Certifying LexBFS recognition algorithms for proper interval graphs and proper interval digraphs

SIAM Journal on Discrete Mathematics

Volumn 18, Issue 3, 2004, Pages 554-570

  Hell, Pavol ^a   Huang, Jing ^b  

^a SIMON FRASER UNIVERSITY   (Canada)

^b UNIVERSITY OF VICTORIA   (Canada)

Author keywords

Bipartite permutation graphs; Bipartite trapezoid graphs; Certifying algorithms; Forbidden subgraph characterizations; Lexicographic breadth first search; Proper circular arc graphs; Proper interval bigraphs; Proper interval graphs; Recognition algorithms

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; PARAMETER ESTIMATION; PATTERN RECOGNITION; SET THEORY;

BIPARTITE PERMUTATION GRAPHS; BIPARTITE TRAPEZOID GRAPHS; CERTIFYING ALGORITHMS; FORBIDDEN SUBGRAPH CHARACTERIZATION; LEXICOGRAPHIC BREADTH FIRST SEARCH; PROPER CIRCULAR ARC GRAPHS; PROPER INTERVAL BIGRAPHS; PROPER INTERVAL GRAPHS; RECOGNITION ALGORITHMS;

GRAPH THEORY;

EID: 23844546945     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895480103430259     Document Type: Article

References (36)

1. A. BRANDSTÄDT, V. B. LE, AND J. P. SPINRAD, Graph Classes: A Survey, SIAM Monogr. Discrete Math. Appl. 3, SIAM, Philadelphia, 1999.
2. A. BRETSCHER, D. G. CORNEIL, M. HABIB, AND C. PAUL, A Simple LexBFS Based Cograph Recognition Algorithm, manuscript.
3. D. E. BROWN, J. R. LUNDGREN, AND S. C. FLINK, Characterizations of interval bigraphs and unit interval bigraphs, in Congressus Num., 157 (2002), pp. 79-93.
4. D. E. BROWN AND J. R. LUNDGREN, Several Characterizations of Unit Interval Bigraphs, manuscript, 2003.
5. J.-M. CHANG, C.-W. Ho, AND M.-T. Ko, LexBFS-ordering in asteroidal triple-free graphs, in Algorithms and Computation, Lecture Notes in Comput. Sci. 1741, Springer-Verlag, Berlin, 1999, pp. 163-172.
6. V. CHEPOI, On distance-preserving and domination elimination orderings, SIAM J. Discrete Math., 11 (1998), pp. 414-436.
7. D. G. CORNEIL, A simple 3-sweep LBFS algorithm for the recognition of unit interval graphs, Discrete Appl. Math., 138 (2004), pp. 371-379.
8. D. G. CORNEIL, H. KIM, S. NATARAJAN, S. OLARIU, AND A. P. SPRAGUE, Simple linear time recognition of unit interval graphs, Inform. Process. Lett., 55 (1995), pp. 99-104.
9. D. G. CORNEIL, S. OLARIU, AND L. STEWART, A Multisweep LBFS Algorithm for the Recognition of Interval Graphs, manuscript.
10. D. G. CORNEIL, private communication, 2003.
11. E. DAHLHAUS, P. L. HAMMER, F. MAFFRAY, AND S. OLARIU, On domination elimination orderings and domination graphs, in Proceedings of the 20th International Workshop in Graph-Theoretic Concepts in Computer Science, Lecture Notes in Comput. Sci. 903, Springer-Verlag, Berlin, 1994, pp. 81-92.
12. X. DENG, P. HELL, AND J. HUANG, Linear-time representation algorithms for proper circular-arc graphs and proper interval graphs, SIAM J. Comput., 25 (1996), pp. 390-403.
13. F. F. DRAGAN AND F. NICOLAI, LexBFS-Orderings of Distance-Hereditary Graphs, Math. Tech. Report, SM-DU-322, University of Duisburg, Germany, 1996.
14. C. M. H. DE FIGUEIREDO, J. MEIDANIS, AND C. P. DE MELLO, A linear time algorithm for proper interval graph recognition, Inform. Process. Lett., 56 (1995), pp. 179-184.
15. M. HABIB, R. MCCONNELL, C. PAUL, AND L. VIENNOT, Lex-bfs and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing, Theoret. Comput. Sci., 234 (2000), pp. 59-84.
16. P. HELLAND J. HUANG, Lexicographic orientation and representation algorithms for comparability graphs, proper circular arc graphs, and proper interval graphs, J. Graph Theory, 20 (1995), pp. 361-374.
17. P. HELL AND J. HUANG, Interval bigraphs and circular arc graphs, J. Graph Theory, 46 (2004), pp. 313-327.
18. D. KRATSCH, R. M. MCUONNELL, K. MEHLHORN, AND J. P. SPINRAD, Certifying algorithms for recognizing interval graphs and permutation graphs, in Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, Baltimore, MD, 2003, pp. 158-167.
19. T. H. LAI AND S. S. WEI, Bipartite permutation graphs with application to the minimum buffer size problem, Discrete Appl. Math., 74 (1997), pp. 33-55.
20. P. J. LOOGES AND S. OLARIU, Optimal greedy algorithm for indifference graphs, Comput. Math. Appl., 25 (1993), pp. 15-25.
21. A. LUBIW, Doubly lexical orderings of matrices, SIAM J. Comput., 16 (1987), pp. 854-879.
22. T. MA, unpublished manuscript related to problems with [28].
23. R. M. MCCONNELL, A certifying algorithm for the consecutive-ones property, in Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, New Orleans, LA, 2004, pp. 761-770.
24. D. MEISTER, Recognition and computation of minimal triangulations for AT-free, claw-free and co-comparability graphs, Discrete Appl. Math., to appear.
25. F. S. ROBERTS, Indifference graphs, in Proof Techniques in Graph Theory, F. Harary, ed., Academic Press, New York, 1969, pp. 301-310.
26. 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.
27. M. SEN AND B. K. SANYAL, Indifference digraphs: A generalization of indifference graphs and semiorders, SIAM J. Discrete Math., 7 (1994), pp. 157-165.
28. K. SIMON, A new simple linear algorithm to recognize interval graphs, in International Workshop on Computational Geometry CG'91, Bern, Switzerland, 1991, H. Bieri and H. Noltemeyer, eds., Lecture Notes in Comput. Sci. 553, Springer-Verlag, Berlin, 1992, pp. 289-308.
29. J. SPINRAD, Efficient Graph Representations, AMS, Providence, RI, 2003.
30. J. SPINRAD, A. BRANDSTÄDT, AND L. STEWART, Bipartite permutation graphs, Discrete Appl. Math., 18 (1987), pp. 279-292.
31. A. P. SPRAGUE, Recognition of bipartite permutation graphs, Congr. Numer., 112 (1995), pp. 151-161.
32. R. E. TARJAN AND M. YANNAKAKIS, Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs, SIAM J. Comput., 13 (1984), pp. 566-579.
33. 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.
34. H. WASSERMAN AND M. BLUM, Software reliability via run-time result-checking, J. ACM, 44 (1997), pp. 826-849.
35. n, Ph.D. thesis, Universität Gottingen, Germany, 1967.
36. D. B. WEST, Short proofs for interval digraphs, Discrete Math., 178 (1998), pp. 287-292.