Computing Pathwidth Faster Than 2 n

DOI10.1007/978-3-642-11269-0_27zbMath1273.68284WikidataQ62046054 ScholiaQ62046054MaRDI QIDQ3656873

Yngve Villanger, Karol Suchan

Publication date: 14 January 2010

Published in: Parameterized and Exact Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-11269-0_27

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

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

05C85: Graph algorithms (graph-theoretic aspects)

68W25: Approximation algorithms