A polynomial time algorithm to compute the connected tree-width of a series-parallel graph.

Christophe Paul Guillaume Mescoff Dimitrios M. Thilikos

Published in: CoRR (2020)

Keyphrases

tree decomposition
tree width
series parallel
computational complexity
objective function
decomposition method
search space
worst case
np hard
dynamic programming
graph theory
constraint networks
probabilistic model
constraint satisfaction problems
combinatorial optimization
string matching