A polynomial time algorithm to compute the connected treewidth of a series-parallel graph

DOI10.1016/j.dam.2021.02.039MaRDI QIDQ831866

Christophe Paul, Dimitrios M. Thilikos, Guillaume Mescoff

Publication date: 24 March 2022

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2021.02.039

zbMATH Keywords

dynamic programming; treewidth; series-parallel graphs; combinatorial algorithms; graph classes; graph decompositions; connected treewidth; width parameters

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

05C05: Trees

91A43: Games involving graphs

68R10: Graph theory (including graph drawing) in computer science

05C85: Graph algorithms (graph-theoretic aspects)