Subexponential Time Algorithms for Finding Small Tree and Path Decompositions

DOI10.1007/978-3-662-48350-3_16zbMath1422.68183arXiv1601.02415WikidataQ59567464 ScholiaQ59567464MaRDI QIDQ3452781

Hans L. Bodlaender, Jesper Nederlof

Publication date: 19 November 2015

Published in: Algorithms - ESA 2015 (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1601.02415

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

68Q25: Analysis of algorithms and problem complexity

90C29: Multi-objective and goal programming

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