A linear time recognition algorithm for proper interval graphs

Information Processing Letters

Volumn 87, Issue 3, 2003, Pages 153-161

  Panda, B S ^a   Das, Sajal K ^b  

^a INDIAN INSTITUTE OF TECHNOLOGY DELHI   (India)

^b The University of Texas at Arlington   (United States)

Author keywords

Algorithms; Chordal graphs; Hamiltonian cycle; Interval graphs; Proper interval graphs

Indexed keywords

ALGORITHMS; GRAPH THEORY; HAMILTONIANS;

INTERVAL GRAPHS;

INFORMATION SCIENCE;

EID: 0037671519     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(03)00298-9     Document Type: Article

References (32)

1. Been C., Fagin R., Maier D., Yannakakis M. On the desirability of acyclic database schemes. J. ACM. 30:1983;479-513.
2. Bertossi A.A. The edge Hamiltonian path problem is NP-complete. Inform. Process. Lett. 13:1981;157-159.
3. Bertossi A.A. Finding Hamiltonian circuits in proper interval graphs. Inform. Process. Lett. 17:1983;97-101.
4. Bertossi A.A., Bonuccelli M.A. Hamiltonian circuits in interval graph generalizations. Inform. Process. Lett. 23:1986;195-200.
5. Booth K.S., Lueker G.S. Testing for the consecutive ones property, interval graphs and graph planarity using PQ-tree algorithms. J. Comput. System Sci. 13:1976;335-379.
6. Cimikowski R.J. Finding Hamiltonian cycles in certain planar graphs. Inform. Process. Lett. 35:1990;249-256.
7. 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.
8. X. Deng, P. Hell, J. Huang, Linear time representation algorithms for proper circular arc graphs and proper interval graphs, Unpublished manuscript, 1993.
9. Dirac G.A. On rigid circuit graphs. Abh. Math. Sem. Univ. Hamburg. 25:1961;71-76.
10. Fulkerson D.R., Gross O.S. Incidence matrices and interval graphs. Pacific J. Math. 15:1965;835-855.
11. Gavril F. Algorithms for minimum coloring, maximum cliques, minimum covering by cliques and maximum independent set in a chordal graph. SIAM J. Comput. 1:1972;180-187.
12. Garey M.R., Johnson D.S. Computers and Intractability: A Guide to the Theory of NP-Completeness. 1979;W.H. Freeman and Company, San Francisco, CA.
13. Garey M.R., Johnson D.S., Tarjan R.E. The planar Hamiltonian cycle problem is NP-complete. SIAM J. Comput. 5:1976;704-714.
14. Gillmore P.C., Hoffman A.J. Characterization of comparability graphs and interval graphs. Canadian J. Math. 16:1964;539-548.
15. Golumbic M.C. Algorithmic Graph Theory and Perfect Graphs. 1980;Academic Press, New York.
16. Gouyou-Beauchamps D. The Hamiltonian circuit problem is polynomial for 4-connected planar graphs. SIAM J. Comput. 11:1982;529-539.
17. Hsu W.L. A simple test for interval graphs. Mayr E.W. Proc. 18th Workshop on Graph Theoretic Concepts in Computer Science. Lecture Notes in Comput. Sci. 657:1993;10-16 Springer, Berlin.
18. Itai A., Papadimitriou C.H., Szwarcfiter J.L. Hamiltonian paths in grid graphs. SIAM J. Comput. 11:1982;676-686.
19. Jamison R.E., Laskar R. Elimination orderings of chordal graphs. Vijayan K.S., Singhi N.M. Proc. of the Seminar on Combinatorics and Applications. 1982;192-200 Indian Statistical Institute, Calcutta, India.
20. Keil J.M. Finding Hamiltonian circuits in Interval graphs. Inform. Process. Lett. 20:1985;201-206.
21. Korte N., Mohring R.H. An incremental linear-time algorithm for recognizing interval graphs. SIAM J. Comput. 18:1989;68-81.
22. Looges P.J., Olariu S. Optimal greedy recognition and coloring of indifference graphs. Balci O. Computer Science and Operation Research: New Results at their Interfaces. 1992;127-137 Pergamon Press, London.
23. Muller H., Nicoli F. Polynomial time algorithms for Hamiltonian problems on bipartite distance-hereditary graphs. Inform. Process. Lett. 46:1993;225-230.
24. Panda B.S., Mohanty S.P. Intersection graphs of vertex disjoint paths in a tree. Discrete Math. 146:1995;179-209.
25. Papadimitriou C., Yannakakis M. Scheduling interval ordered tasks. SIAM J. Comput. 8:1979;405-409.
26. Rabinovitch I. The Scott-Suppes theorem on semiorders. J. Math. Psych. 15:1977;209-212.
27. Roberts F.S. Indifferences graphs. Harary F. Proof Techniques in Graph Theory. 1971;139-146 Academic Press, New York.
28. Roberts F.S. Graph Theory and its Application to Problems of Society. 1978;SIAM, Philadelphia, PA.
29. Scott D., Suppes P. Foundational aspects of theories of measurement. J. Symbolic Logic. 23:1958;113-128.
30. Shih W.K., Chen T.C., Hsu H. An O(nlogn) algorithm for the Hamiltonian cycle problem on circular-arc graphs. SIAM J. Comput. 21:1992;1026-1046.
31. Sreenivasa Kumar P., Veni Madhavan C.E. 2-separator chordal graphs. De Sarkar S.C. Proc. 3rd National Seminar on Theoretical Computer Science. 1993;37-52 IIT Kharagpur, India.
32. Tarjan R.E., Yannakakis M. Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs. SIAM J. Comput. 13:1984;225-231.