Login / Signup
Semi-nice tree-decompositions: The best of branchwidth, treewidth and pathwidth with one algorithm.
Frederic Dorn
Jan Arne Telle
Published in:
Discret. Appl. Math. (2009)
Keyphrases
</>
optimal solution
search space
computational complexity
space complexity
np hard
tree decompositions
objective function
upper bound
worst case