Algorithms Based on the Treewidth of Sparse Graphs.

Joachim Kneis Daniel Mölle Stefan Richter Peter Rossmanith

Published in: WG (2005)

Keyphrases

graph theory
learning algorithm
significant improvement
optimization problems
space complexity
data structure
computational complexity
computationally efficient
decision trees
high dimensional
evolutionary algorithm
computational cost
upper bound
graph structure
representational power
constraint graph