Generating and characterizing the perfect elimination orderings of a chordal graph

Theoretical Computer Science

Volumn 307, Issue 2, 2003, Pages 303-317

  Chandran, L S ^a   Ibarra, L ^b,d   Ruskey, F ^c   Sawada, J ^c,e  

^a INDIAN INSTITUTE OF SCIENCE   (India)

^b SIMON FRASER UNIVERSITY   (Canada)

^c UNIVERSITY OF VICTORIA   (Canada)

^d DEPAUL UNIVERSITY   (United States)

^e UNIVERSITY OF TORONTO   (Canada)

Author keywords

2 Processor scheduling; Antimatroid; Chordal graph; Clique tree; Gray code; Perfect elimination ordering

Indexed keywords

ALGORITHMS; CODES (SYMBOLS); TREES (MATHEMATICS);

GRAY CODES;

GRAPH THEORY;

EID: 0141636259     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(03)00221-4     Document Type: Conference Paper

References (17)

1. Björner A., Ziegler G.M. Introduction to greedoids. White N. Matroid Applications. 1992;Cambridge University Press, Cambridge.
2. J.R.S. Blair, B. Peyton, An introduction to chordal graphs and clique trees, Graph Theory and Sparse Matrix Computation, Springer, Berlin, Vol. 56, 1993, pp. 1-29.
3. Buneman P. A characterization of rigid circuit graphs. Discrete Math. 9:1974;205-212.
4. Coffman E., Graham R.L. Optimal scheduling for two-processor systems. Acta Inform. 1:1972;200-213.
5. Dirac G.A. On rigid circuit graphs. Abh. Math. Sem. Univ. Hamburg. 24:1961;71-76.
6. Fulkerson D.R., Gross O.A. Incidence matrices and interval graphs. Pacific J. Math. 15:1965;835-855.
7. Gavril F. The intersection graphs of subtrees in trees are exactly the chordal graphs. J. Combin. Theory B. 16:1974;47-56.
8. Golumbic M.C. Algorithmic Graph Theory and Perfect Graphs. 1980;Academic Press, New York.
9. Korte B., Lovász L., Schrader R. Greedoids. 1991;Springer, Berlin.
10. Kumar P.S., Veni Madhavan C.E. Minimal vertex separators of chordal graphs. Discrete Appl. Math. 89:1998;155-168.
11. Pruesse G., Ruskey F. Gray codes for antimatroids. Order. 10:1993;239-252.
12. Pruesse G., Ruskey F. Generating linear extensions fast. SIAM J. Comput. 23(2):1994;373-386.
13. Rose D., Tarjan R., Lueker G. Algorithmic aspects of vertex elimination on graphs. SIAM J. Comput. 5:1975;266-283.
14. Shier D.R. Some aspects of perfect elimination orderings in chordal graphs. Discrete Appl. Math. 7:1984;325-331.
15. Simon K. A note on lexicographic breadth first search for chordal graphs. Inform. Process. Lett. 54:1995;249-251.
16. Tarjan R., Yannakakis M. Simple linear-time algorithm to test chordality of graphs, test acyclicity of hypergraphs, and selectivity reduce acyclic hypergraphs. SIAM J. Comput. 13:1984;566-579.
17. Walter J.R. Representations of chordal graphs as subtrees of a tree. J. Graph Theory. 2:1978;265-267.