Fast Sub-exponential Algorithms and Compactness in Planar Graphs

DOI10.1007/978-3-642-23719-5_31zbMath1346.68117MaRDI QIDQ3092244

Dimitrios M. Thilikos

Publication date: 16 September 2011

Published in: Algorithms – ESA 2011 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-23719-5_31

zbMATH Keywords

planar graphs; parameterized algorithms; branchwidth

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

05C10: Planar graphs; geometric and topological aspects of graph theory

05C85: Graph algorithms (graph-theoretic aspects)