On the maximum weight minimal separator

DOI10.1016/j.tcs.2019.09.025zbMath1435.68239MaRDI QIDQ2333804

Hans L. Bodlaender, Hirotaka Ono, Tesshu Hanaka, Tom C. van der Zanden

Publication date: 13 November 2019

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2019.09.025

zbMATH Keywords

treewidth; minimal separator; parameterized algorithm

Mathematics Subject Classification ID

68W40: Analysis of algorithms

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

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

05C85: Graph algorithms (graph-theoretic aspects)

68W20: Randomized algorithms