On the Maximum Weight Minimal Separator

DOI10.1007/978-3-319-55911-7_22zbMath1435.68238WikidataQ59567382 ScholiaQ59567382MaRDI QIDQ2988830

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

Publication date: 19 May 2017

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-55911-7_22

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