Minimal elimination ordering inside a given chordal graph

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1335, Issue , 1997, Pages 132-143

  Dahlhaus, Elias ^a,b  

^a UNIVERSITY OF BONN   (Germany)

^b UNIVERSITY OF COLOGNE   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CHORDAL GRAPHS; FOLLOWING PROBLEM; GRAPH G; MINIMAL ELIMINATION ORDERING; SUBGRAPHS;

GRAPH THEORY;

EID: 84949681561     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0024494     Document Type: Conference Paper

References (17)

1. A. Agrawal, P. Klein, R. Ravi, Cutting Down on Fill-in Using Nested Dissection, in Sparse Matrix Computations: Graph Theory Issues and Algorithms, A. George, J. Gilbert, J.W.-H. Liu ed., IMA Volumes in Mathematics and its Applications, Vol. 56, Springer Verlag, 1993, pp. 31-55.
2. J. Blair, P. Heggernes, J.A. TelIe, Making an Arbitrary Filled Graph Minimal by Removing FilI Edges, Algorithm Theory. SWAT96, R. Karlsson, A. Lingas ed, LLNCS 1097, pp. 173-184.
3. P. Bunemann, A Characterization of Rigid Circuit Graphs, Discrete Mathematics 9 (1974), pp. 205-212.
4. E. Dahlhaus, Fast parallel algorithm for the single link heuristics of hierarchical clustering, Proceedings of the fourth IEEE Symposium on Parallel and Distributed Processing (1992), pp. 184-186.
5. E. Dahlhaus, Efficient Parallel Algorithms on Chordal Graphs with a Sparse Tree Representation, Proceedings of the 27-th Annual Hawaii International Conference on System Sciences, Vot. 2 (1994), pp. 150-158.
6. Elias Dahlhaus, Sequential and Parallel Algorithms on Compactly Represented Chordal and Strongly Chordal Graphs, STACS 97, R. Reischuk, M. Morvan ed., LLNCS 1200 (1997), pp. 487-498.
7. Elias Dahlhaus, Marek Karpinski, An Efficient Parallel Algorithm for the Minima• Elimination Ordering (MEO) of an Arbitrary Graph, Theoretical Computer Science 134 (1994), pp. 493-528.
8. M. Farber, Characterizations of Strongly Chordal Graphs, Discrete Mathematics 43 (1983), pp. 173-189.
9. F. Gavril, The Intersection Graphs of Subtrees in Trees Are Exactly the Chordal Graphs, Journal of Combinatorial Theory Series B, vol. 16(1974), pp. 47-56.
10. A. George, J.W.-H. Liu, Computer Solution of Large Sparse Positive Definite Systems, Prentice Hall Inc., Englewood Cliffs, NJ, 1981.
11. J. Gilbert, H. Hafsteinsson, Parallel Soiution of Sparse Linear Systems, SWAT 88 (1988), LNCS 318, pp. 145-153.
12. D. Rose, Triangulated Graphs and the Elimination Process, Journal of Mathematical Analysis and Applications 32 (1970), pp. 597-609.
13. D. Rose, R. Tarjan, G. Lueker, Algorithmic Aspects on Vertex Elimination on Graphs, SIAM Journal on Computing 5 (1976), pp. 266-283.
14. Y. Shiloach, U. Vishkin, An O(log n) Parallel Connectivity Algorithm, Journal of Algorithms 3 (1982), pp. 57-67.
15. R. Tarjan, Efficiency of a Good but not Linear Set Union Algorithm, Journal of the ACM 22 (1975), pp. 215-225.
16. R. Tarjan, M. Yannakakis, Simple Linear Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs, SIAM Journal on Computing 13 (1984), pp. 566-579. Addendum: SIAM Journal on Computing 14 (1985), pp. 254-255.
17. M. Yannakakis, Computing the Minimum Fill-in is NP-complete, SIAM Journal on Algebraic and Discrete Methods 2 (1981), pp. 77-79