Maximum cardinality search for computing minimal triangulations

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

Volumn 2573 LNCS, Issue , 2002, Pages 1-12

  Berry, Anne ^a   Blair, Jean R S ^b   Heggernes, Pinar ^c  

^a UNIVERSITÉ BLAISE PASCAL   (France)

^b UNITED STATES MILITARY ACADEMY   (United States)

^c UNIVERSITY OF BERGEN   (Norway)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH THEORY; SURVEYING; TRIANGULATION;

ARBITRARY GRAPHS; CARDINALITIES; CHORDAL GRAPHS; FUNDAMENTAL CONCEPTS; MINIMAL TRIANGULATIONS; SIMPLER ALGORITHMS; TIME COMPLEXITY;

TRIANGULATION; ALGORITHMS;

EID: 84901438169     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36379-3_1     Document Type: Conference Paper

References (11)

1. A. Berry, A wide-range efficient algorithm for minimal triangulation, in Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms, 1999.
2. J. R. S. Blair, P. Heggernes, and J. A. Telle, A practical algorithm for making filled graphs minimal, Theoretical Computer Science, 250 (2001), pp. 125-141.
3. E. Dahlhaus, Minimal elimination ordering inside a given chordal graph, inGraph Theoretical Concepts in Computer Science - WG '97, R. H. Möhring, ed., Springer Verlag, 1997, pp. 132-143. Lecture Notes in Computer Science 1335.
4. D. R. Fulkerson and O. A. Gross, Incidence matrices and interval graphs, Pacific J. Math., 15 (1965), pp. 835-855.
5. T. Ohtsuki, A fast algorithm for finding an optimal ordering in the vertex elimination on a graph, SIAM J. Comput., 5 (1976), pp. 133-145.
6. 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), pp. 622-633.
7. S. Parter, The use of linear graphs in Gauss elimination, SIAM Review, 3 (1961), pp. 119-130.
8. B. Peyton, Minimal orderings revisited, SIAM J. Matrix Anal. Appl., 23 (2001), pp. 271-294.
9. D. J. Rose, R. E. Tarjan, and G. S. Lueker, Algorithmic aspects of vertex elimination on graphs, SIAM J. Comput., 5 (1976), pp. 266-283.
10. 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), pp. 566-579.
11. M. Yannakakis, Computing the minimum fill-in is NP-complete, SIAM J. Alg. Disc. Meth., 2 (1981), pp. 77-79.