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

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2005, Pages 907-916

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

^a UNIVERSITY OF BERGEN   (Norway)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; ITERATIVE METHODS; MATRIX ALGEBRA; SET THEORY; THEOREM PROVING; TREES (MATHEMATICS);

ALGORITHM PARTITION; MATRIX MULTIPLICATION ALGORITHMS; PHYLOGENETIC TREES; TRIANGULATION ALGORITHMS;

GRAPH THEORY;

EID: 20744452897     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (19)

1. A. Berry, J-P. Bordat, and P. Heggernes. Recognizing weakly triangulated graphs by edge separability. Nordic Journal of Computing, 7:164-177, 2000.
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, pages 47-57. Springer Verlag, 2003. LNCS 2906.
4. J. R. S. Blair, P. Heggernes, and J. A. Telle. A practical algorithm for making filled graphs minimal. Theor. Comput. Sci., 250:125-141, 2001.
5. V. Bouchitté and I. Todinca. Treewidth and minimum fill-in: Grouping the minimal separators. SIAM J. Comput., 31:212-232, 2001.
6. D. Coppersmith and S. Winograd. Matrix multiplication via arithmetic progressions. J. Symb. Comp., 9:1-6, 1990.
7. E. Dahinaus. Minimal elimination ordering inside a given chordal graph. In Graph Theoretical Concepts in Computer Science - WG '97, pages 132-143. Springer Verlag, 1997. LNCS 1335.
8. P. Heggernes and Y. Villanger. Efficient implementation of a minimal triangulation algorithm. In Algorithms - ESA 2002, pages 550-561. Springer Verlag, 2002. LNCS 2461.
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, pages 198-207. 1999.
10. T. Kloks, D. Kratsch, and J. Spinrad. On treewidth and minimum fill-in of asteroidal triple-free graphs. Theor. Comput. Sci., 175:309-335, 1997.
11. th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2003), pages 709-716, 2003.
12. 3) time. 2004. Submitted.
13. T. Ohtsuki. A fast algorithm for finding an optimal ordering in the vertex elimination on a graph. SIAM J. Comput., 5:133-145, 1976.
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:622-633, 1976.
15. A. Parra and P. Scheffler. Characterizations and algorithmic applications of chordal graph embeddings. Disc. Appl. Math., 79:171-188, 1997.
16. B. W. Peyton. Minimal orderings revisited. SIAM J. Matrix Anal. Appl., 23(1):271-294, 2001.
17. D. Rose, R.E. Tarjan, and G. Lueker. Algorithmic aspects of vertex elimination on graphs. SIAM J. Comput., 5:146-160, 1976.
18. V. Strassen. Gaussian elimination is not optimal. Numerische Mathematik, 14:354-356, 1969.
19. J. van Leeuwen. Graph algorithms. In Handbook of Theoretical Computer Science, A: Algorithms and Complexity Theory. North Holland, 1990.