Minimal vertex separators of chordal graphs

Discrete Applied Mathematics

Volumn 89, Issue 1-3, 1998, Pages 155-168

  Sreenivasa Kumar, P ^a   Veni Madhavan, C E ^b  

^a INDIAN INSTITUTE OF TECHNOLOGY MADRAS   (India)

^b INDIAN INSTITUTE OF SCIENCE   (India)

Author keywords

Chordal graphs; Lexicographic breadth first search; Maximum cardinality search; Minimal vertex separators

Indexed keywords

EID: 0043080082     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0166-218x(98)00123-1     Document Type: Article

References (14)

1. A.V. Aho, J.E. Hopcroft, J.D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, MA, 1974.
2. C. Beeri, R. Fagin, D. Maier, M. Yannakakis, On the desirability of acyclic database schemes, JACM 30 (1983) 479-513.
3. G.A. Dirac, On rigid circuit graphs, Abh. Math. Sem. Univ. Hamburg 25 (1961) 71-76.
4. D.R. Fulkerson, O.A. Gross, Incidence matrices and interval graphs, Pacific J. Math. 15 (1965) 835-855.
5. M.C. Golumbic, Algorithmic Graph Theory and Perfect Graphs, Academic Press, New York, 1980.
6. C. Papadimitriou, M. Yannakakis, Scheduling interval ordered tasks, SIAM J. Comput. 8 (1979) 405-409.
7. D.J. Rose, Triangulated graphs and the elimination process, J. Math. Anal. Appl. 32 (1970) 597-609.
8. D.J. Rose, A graph-theoretic study of the numerical solution of sparse positive-definite systems of linear equations, in: R.C. Reed (Ed.), Graph Theory and Computing, Academic Press, New York, 1972, pp. 183-217.
9. D.J. Rose, R.E. Tarjan, G.S. Leuker, Algorithmic aspects of vertex elimination on graphs, SIAM J. Comput. 5 (1976) 266-283.
10. P. Sreenivasa Kumar, C.E. Veni Madhavan, Clique hypergraphs of chordal graphs and subclasses, Proc. R.C. Bose Memorial Conf. on Combinatorial Mathematics and Applications, Indian Statistical Institute, Calcutta, December 1988.
11. P. Sreenivasa Kumar, Algorithmic and structural results on chordal graphs, Ph.D. Thesis, Department of Computer Science and Automation, Indian Institute of Science, Bangalore, India, September 1990.
12. P. Sreenivasa Kumar, C.E. Veni Madhavan, 2-Separator Chordal Graphs, Proc. National Symp. on Theoretical Computer Science, Kharagpur, India, June 1993, pp. 37-52.
13. R.E. Tarjan, M. Yannakakis, Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs and selectively reduce acyclic hypergraphs, SIAM J. Comput. 13 (3) (1984) 565-579.
14. N.Ch. Veeraraghavulu, P. Sreenivasa Kumar, C.E. Veni Madhavan, A linear-time algorithm for isomorphism of a subclass of chordal graphs, Inform. Process. Lett. 44 (1992) 45-50.