Minimal fill in O(n2.69) time

Discrete Mathematics

Volumn 306, Issue 3, 2006, Pages 366-371

  Kratsch, Dieter ^a   Spinrad, Jeremy ^b  

^a UNIVERSITÉ DE LORRAINE   (France)

^b VANDERBILT UNIVERSITY   (United States)

Author keywords

Minimal fill; Triangulation

Indexed keywords

ALGORITHMS; MATRIX ALGEBRA; PROBLEM SOLVING; TRIANGULATION;

GRAPH ORDERING; LEX-M ALGORITHM; MINIMAL FILL;

GRAPH THEORY;

EID: 33344458097     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.disc.2005.12.009     Document Type: Article

References (15)

1. A. Berry, A Wide-Range Efficient Algorithm for Minimal Triangulation, 10th Symposium on Discrete Algorithms, 1999, pp. 860-861.
2. A. Berry, J.-P Bordat, P. Heggernes, G. Simonet, Y. Villanger, A wide-range algorithm for minimal triangulation from an arbitrary ordering, Research Report LIMOS/RR-03-02, Université Clermont-Ferrand II.
3. D. Coppersmith, and S. Winograd Matrix multiplication via arithmetic progressions J. Symbolic Comput. 9 1990 1 6
4. M.R. Garey, and D.S. Johnson Computers and Intractability - A Guide to the Theory and Practice of NP-Completeness 1979 W.H. Freeman San Francisco
5. P. Heggernes, J.A. Telle, Y. Villanger, Computing Minimal Triangulations in O (n α log n ) = o (n 2.376 ), SODA 2005, to appear.
6. J. Holm, K. de Lichtenberg, M. Thorup, Poly-logarithmic Deterministic Fully-Dynamic Algorithms for Connectivity, Minimum Spanning Tree, 2-edge, and Biconnectivity, STOC 98, 79-89
7. D. Kratsch, J. Spinrad, Between O (nm ) and O (n α ), 14th Annual ACM-SIAM Symposium on Discrete Algorithms, 2003, pp. 709-716.
8. T. Ohtsuki A fast algorithm for finding an optimal ordering for vertex elimination on a graph SIAM J. Comput. 5 1976 133 145
9. S. Parter The use of linear graphs in Gauss elimination SIAM Rev. 3 1961 1190139
10. D.J. Rose, and R.E. Tarjan Algorithmic aspects of vertex elimination on directed graphs SIAM J. Appl. Math. 34 1978 176 197
11. D. Rose, R.E. Tarjan, and G. Lueker Algorithmic aspects of vertex elimination on graphs SIAM J. Comput. 5 1976 266 283
12. V. Strassen Gaussian elimination is not optimal Numer. Math. 14 1969 354 356
13. R.E. Tarjan Decomposition by clique separators Discrete Math. 55 1985 221 232
14. R.E. Tarjan, and M. Yannakakis Simple linear-time algorithms to test chordality of graphs, and selectively reduce acyclic hypergraphs SIAM J. Comput. 13 1984 566 579
15. M. Yannakakis Computing the minimum fill-in is NP-complete SIAM J. Algebraic Discrete Methods 3 1982 351 358