Subexponential Parameterized Algorithms for Bounded-Degree Connected Subgraph Problems on Planar Graphs
From MaRDI portal
Publication:2839212
DOI10.1016/j.endm.2009.02.009zbMath1267.05271MaRDI QIDQ2839212
Ignasi Sau, Dimitrios M. Thilikos
Publication date: 4 July 2013
Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.endm.2009.02.009
planar graphs; parameterized complexity; graph minors; subexponential algorithm; bidimensionality; branch decomposition; Catalan structures
05C85: Graph algorithms (graph-theoretic aspects)