Computing minimal triangulations in time O(nαlog n) = o(n2.376)

SIAM Journal on Discrete Mathematics

Volumn 19, Issue 4, 2005, Pages 900-913

  Heggernes, Pinar ^a   Telle, Jan Arne ^a   Villanger, Yngve ^a  

^a UNIVERSITY OF BERGEN   (Norway)

Author keywords

Chordal graph; Matrix multiplication; Minimal fill; Minimal triangulation

Indexed keywords

ALGORITHMS; COMPUTATION THEORY; COMPUTATIONAL COMPLEXITY; GRAPH THEORY;

CHORDAL GRAPH; MATRIX MULTIPLICATION; MINIMAL FILL; MINIMAL TRIANGULATION ALGORITHMS;

COMPUTATIONAL GEOMETRY;

EID: 33344462132     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895480104445010     Document Type: Article

References (19)

1. A. BERRY, J.-P. BORDAT, AND P. HEGGERNES, Recognizing weakly triangulated graphs by edge separability, Nordic J. Comput., 7 (2000), pp. 164-177.
2. A. BERRY, J.-P. BORDAT, P. HEGGERNES, G. SIMONET, AND Y. VILLANGER, A wide-range algorithm for minimal triangulation from an arbitrary ordering, J. Algorithms, to appear.
3. A. BERRY, P. HEGGERNES, AND Y. VILLANGER, A vertex incremental approach for dynamically maintaining chordal graphs, in Algorithms and Computation - ISAAC 2003, Lecture Notes Comput. Sci. 2906, Springer-Verlag, Berlin, 2003, pp. 47-57.
4. J. R. S. BLAIR, P. HEGGERNES, AND J. A. TELLE, A practical algorithm for making filled graphs minimal, Theoret. Comput. Sci., 250 (2001), pp. 125-141.
5. V. BOUCHITTÉ AND I. TODINCA, Treewidth and minimum fill-in: Grouping the minimal separators, SIAM J. Comput., 31 (2001), pp. 212-232.
6. D. COPPERSMITH AND S. WINOGRAD, Matrix multiplication via arithmetic progressions, J. Symbolic Comput., 9 (1990), pp. 1-6.
7. E. DAHLHAUS, Minimal elimination ordering inside a given chordal graph, in Graph-Theoretic Concepts in Computer Science - WG '97, Lecture Notes in Comput. Sci. 1335, Springer-Verlag, Berlin, 1997, pp. 132-143.
8. P. HEGGERNES AND Y. VILLANGER, Efficient implementation of a minimal triangulation algorithm, in Algorithms - ESA 2002, Lecture Notes in Comput. Sci. 2461, Springer-Verlag, Berlin, 2002, pp. 550-561.
9. D. HUDSON, S. NETTLES, AND T. WARNOW, Obtaining highly accurate topology estimates of evolutionary trees from very short sequences, in Proceedings of RECOMB'99, 1999, pp. 198-207.
10. T. KLOKS, D. KRATSCH, AND J. SPINRAD, On treewidth and minimum fill-in of asteroidal triple-free graphs, Theoret. Comput. Sci., 175 (1997), pp. 309-335.
11. α), in Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2003), SIAM, Philadelphia, 2003, pp. 709-716.
12. 3) time, Discrete Math., submitted.
13. T. OHTSUKI, A fast algorithm for finding an optimal ordering for vertex elimination on a graph, SIAM J. Comput., 5 (1976), pp. 133-145.
14. 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.
15. A. PARRA AND P. SCHEFFLER, Characterizations and algorithmic applications of chordal graph embeddings, Discrete Appl. Math., 79 (1997), pp. 171-188.
16. B. W. PEYTON, Minimal orderings revisited, SIAM J. Matrix Anal. Appl., 23 (2001), pp. 271-294.
17. D. ROSE, R. E. TARJAN, AND G. LUEKER, Algorithmic aspects of vertex elimination on graphs, SIAM J. Comput., 5 (1976), pp. 266-283.
18. V. STRASSEN, Gaussian elimination is not optimal, Numer. Math., 14 (1969), pp. 354-356.
19. J. VAN LEEUWEN, Graph algorithms, in Handbook of Theoretical Computer Science, A: Algorithms and Complexity Theory, North-Holland, Amsterdam, 1990.