Fast Minimal Triangulation
Keywords and Synonyms
Minimal fill problem
Minimal triangulation is the addition of an inclusion minimal set of edges to an arbitrary undirected graph, such that a chordal graph is obtained. A graph is chordal if every cycle of length at least 4 contains an edge between two nonconsecutive vertices of the cycle.
- 4.Fomin, F.V., Kratsch, D., Todinca, I.: Exact (exponential) algorithms for treewidth and minimum fill-in. In: ICALP of LNCS, vol. 3142, pp. 568–580. Springer, Berlin (2004)Google Scholar
- 6.Huson, D.H., Nettles, S., Warnow, T.: Obtaining highly accurate topology estimates of evolutionary trees from very short sequences. In: RECOMB, 1999, pp. 198–207Google Scholar