A simple 3-sweep LBFS algorithm for the recognition of unit interval graphs

Discrete Applied Mathematics

Volumn 138, Issue 3, 2004, Pages 371-379

  Corneil, Derek G ^a  

^a UNIVERSITY OF TORONTO   (Canada)

Author keywords

Graph recognition algorithm; Lexicographic breadth first search; Proper interval graphs; Unit interval graphs

Indexed keywords

ALGORITHMS; COMPUTER SCIENCE; MATHEMATICAL MODELS; MATHEMATICAL PROGRAMMING; PROBLEM SOLVING; THEOREM PROVING;

GRAPH RECOGNITION ALGORITHMS; LEXICOGRAPHIC BREADTH FIRST SEARCH (LBFS); PROPER INTERVAL GRAPHS; UNIT INTERVAL GRAPHS;

GRAPH THEORY;

EID: 1642601796     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2003.07.001     Document Type: Article

References (22)

1. A. Bretscher, D.G. Corneil, M. Habib, C. Paul, A simple linear time LexBFS cograph recognition algorithm - extended abstract, Proceedings of the 29th WG Workshop, Elspeet, The Netherlands, 2003, to appear.
2. J.-M. Chang, C.-W. Ho, M.-T. Ko, LexBFS-ordering in asteroidal triple-free graphs, in: A. Aggarwal, C. Pandu Rangan (Eds.), Proceedings of the ISAAC 99, 10th Symposium on Algorithms and Computation, Lectures Notes in Computer Science, Vol. 1741, Springer, Berlin, 1999, pp. 163-172.
3. Corneil D.G., Kim H., Natarajan S., Olariu S., Sprague A.P. Simple linear time recognition of unit interval graphs. Inform. Process. Lett. 55:1995;99-104.
4. D.G. Corneil, S. Olariu, L. Stewart, The LBFS structure and recognition of interval graphs, in preparation; extended abstract appeared as The ultimate interval graph recognition algorithm? - extended abstract, in: Proceedings of SODA 98, Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, CA, USA, 1998, pp. 175-180.
5. Deng X., Hell P., Huang J. Linear time representation algorithms for proper circular arc graphs and proper interval graphs. SIAM J. Comput. 25:1996;390-403.
6. de Figueiredo C.M.H., Meidanis J., de Mello C.P. A linear-time algorithm for proper interval graph recognition. Inform. Process. Lett. 56:1995;179-184.
7. Golumbic M.C. Algorithmic Graph Theory and Perfect Graphs. 1980;Academic Press, New York.
8. Habib M., McConnell R., Paul C., Viennot L. Lex-bfs and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing. Theoret. Comput. Sci. 234:2000;59-84.
9. P. Hell, J. Huang, Certifying LexBFS recognition algorithms for proper interval graphs and proper interval bigraphs, manuscript, 2003.
10. Hell P., Shamir R., Sharan R. A fully dynamic algorithm for recognizing and representing proper interval graphs. SIAM J. Comput. 31:2001;289-305.
11. Korte N., Möhring H. An incremental linear-time algorithm for recognizing interval graphs. SIAM J. Comput. 18:1989;68-81.
12. D. Kratsch, R.M. McConnell, K. Mehlhorn, J.P. Spinrad, Certifying algorithms for recognizing interval graphs and permutation graphs, in: Proceedings of the SODA 03, 14th Annual ACM-SIAM Symposium on Discrete Algorithms, Baltimore, MD, USA, 2003, pp. 158-167.
13. J.-M. Lanlignel, Private communications, 1999.
14. Looges P.J., Olariu S. Optimal greedy algorithms for indifference graphs. Comput. Math. Appl. 25:1993;15-25.
15. T. Ma, unpublished manuscript.
16. D. Meister, Recognizing and computing minimal triangulations efficiently, Technical Report 302, Fakultät für Mathematik und Informatik, Universität Würzburg, 2002.
17. Panda B.S., Das S.K. A linear time recognition algorithm for proper interval graphs. Inform. Process. Lett. 87:2003;153-161.
18. Roberts F.S. Indifference graphs. Harary F. Proof Techniques in Graph Theory. 1969;139-146 Academic Press, New York.
19. Roberts F.S. On the compatibility between a graph and a simple order. J. Combin. Theory Ser. B. 11:1971;28-38.
20. Rose D.J., Tarjan R.E., Lueker G.S. Algorithmic aspects of vertex elimination on graphs. SIAM J. Comput. 5:1976;266-283.
21. K. Simon, A new simple linear algorithm to recognize interval graphs, in: H. Bieri, H. Noltemeyer (Eds.), Proceedings of the CG 91, International Workshop on Computational Geometry, Lectures Notes in Computer Science, Vol. 553, Springer, Berlin, 1992, pp. 289-308.
22. n, Ph.D. Thesis, Universität Gottigen, Germany, 1967.