Exact Algorithms for Treewidth and Minimum Fill-In

14 years 11 days ago

We show that the treewidth and the minimum fill-in of an n-vertex graph can be

Fedor V. Fomin, Dieter Kratsch, Ioan Todinca, Yngv

Minimum Fill-in | N-vertex Graph | SIAMCOMP 2008 | Treewidth |

claim paper

Added	14 Dec 2010
Updated	14 Dec 2010
Type	Journal
Year	2008
Where	SIAMCOMP
Authors	Fedor V. Fomin, Dieter Kratsch, Ioan Todinca, Yngve Villanger

Comments (0)