Exact (Exponential) Algorithms for Treewidth and Minimum Fill-In.

Fedor V. Fomin Dieter Kratsch Ioan Todinca

Published in: ICALP (2004)

Keyphrases

computational cost
upper bound
learning algorithm
orders of magnitude
computational complexity
significant improvement
probabilistic model
optimization problems
recently developed
space complexity
benchmark datasets
computational efficiency
computationally expensive
combinatorial optimization