Maximum cardinality search for computing minimal triangulations of graphs

Algorithmica (New York)

Volumn 39, Issue 4, 2004, Pages 287-298

  Berry, Anne ^a   Blair, Jean R S ^b   Heggernes, Pinar ^c   Peyton, Barry W ^d  

^a UNIVERSITÉ BLAISE PASCAL   (France)

^b UNITED STATES MILITARY ACADEMY   (United States)

^c UNIVERSITY OF BERGEN   (Norway)

^d DALTON STATE COLLEGE   (United States)

Author keywords

Chordal graphs; Minimal elimination ordering; Minimal fill; Minimal triangulations

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; GRAPH THEORY; TRIANGULATION;

CHORDAL GRAPHS; MINIMAL ELIMINATION ORDERING; MINIMAL FILL; MINIMAL TRIANGULATIONS;

ALGORITHMS;

EID: 21044444304     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00453-004-1084-3     Document Type: Article

References (20)

1. C. Beeri, R. Fagin, D. Maier, and M. Yannakakis, On the desirability of acyclic database systems, J. Assoc. Comput. Mach., 30 (1983), 479-513.
2. A. Berry, A wide-range efficient algorithm for minimal triangulation, in Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms, 1999.
3. A. Berry, J. R. S. Blair, and P. Heggernes, Maximum cardinality search for computing minimal triangulations, in Graph Theoretical Concepts in Computer Science - WG 2002, L. Kucera, ed., Springer-Verlag, Berlin, 2002. Lecture Notes in Computer Science.
4. A. Berry and J.-P. Bordat. Separability generalizes Dirac's theorem, Discrete Appl. Math., 84 (1998), 43-53.
5. J. R. S. Blair, P. Heggernes, and J. A. Telle, A practical algorithm for making filled graphs minimal. Theoret. Compul. Sci., 250 (2001), 125-141.
6. J. R. S. Blair and B. W. Peyton. An introduction to chordal graphs and clique trees, in Graph Theory and Sparse Matrix Computations, J. A. George, J. R. Gilbert, and J. W. H. Liu, eds., Springer-Verlag, New York, 1993, pp. 1-30. IMA Volumes in Mathematics and its Applications, Vol. 56.
7. F. R. K. Chung and D. Mumford, Chordal completions of planar graphs, J. Combin. Theory, 31 (1994), 96-106.
8. E. Dahlhaus, Minimal elimination ordering inside a given chordal graph, in Graph Theoretical Concepts in Computer Science - WG '97, R. H. Möhring. ed., Springer-Verlag, Berlin, 1997, pp. 132-143. Lecture Notes in Computer Science 1335.
9. D. R. Fulkerson and O. A. Gross. Incidence matrices and interval graphs. Pacific J. Math., 15 (1965), 835-855.
10. A. George and J. W. H. Liu, Computer Solution of Large Sparse Positive Definite Systems, Prentice-Hall, Englewood Cliffs, NJ. 1981.
11. S. L. Lauritzen and D. J. Spiegelhalter, Local computations with probabilities on graphical structures and their applications to expert systems, J. Roy. Statist. Soc. Ser, B. 50 (1988), 157-224.
12. T. Ohtsuki, A fast algorithm for finding an optimal ordering in the vertex elimination on a graph, SIAM J. Comput., 5 (1976), 133-145.
13. T. Ohtsuki, L. K. Cheung, and T. Fujisawa, Minimal triangulation of a graph and optimal pivoting ordering in a sparse matrix, J. Math. Anal. Appl., 54 (1976), 622-633.
14. S. Parter, The use of linear graphs in Gauss elimination, SIAM Rev., 3 (1961), 119-130.
15. B. Peyton, Minimal orderings revisited, SIAM J. Matrix Anal. Appl, 23 (2001), 271-294.
16. D. J. Rose, Triangulated graphs and the elimination process, J. Math. Anal. Appl., 32 (1970), 597-609.
17. D. J. Rose, A graph-theoretic study of the numerical solution of sparse positive definite systems of linear equations, in Graph Theory and Computing, R. C. Read, ed., Academic Press, New York, 1972, pp. 183-217.
18. D. J. Rose, R. E. Tarjan, and G. S. Lueker, Algorithmic aspects of vertex elimination on graphs, SIAM J. Comput., 5 (1976), 266-283.
19. R. E. Tarjan and M. Yannakakis, Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs, SIAM J. Comput., 13 (1984), 566-579.
20. M. Yannakakis, Computing the minimum fill-in is NP-complete, SIAM J. Algebraic Discrete Methods, 2 (1981), 77-79.