Sign in
A polynomial time algorithm to compute the connected treewidth of a series-parallel graph.
Guillaume Mescoff
Christophe Paul
Dimitrios M. Thilikos
Published in:
Discret. Appl. Math. (2022)
Keyphrases
</>
series parallel
computational complexity
worst case
graph structure
objective function
search space
space complexity
polynomial time complexity
binary trees
optimization algorithm
special case
tree decomposition
optimal solution
upper bound
np hard
bounded treewidth
simulated annealing