Subexponential parameterized algorithms for degree-constrained subgraph problems on planar graphs

We present subexponential parameterized algorithms on planar graphs for a family of problems of the following shape: given a graph, find a connected (induced) subgraph with bounded maximum degree and with maximum number of edges (or vertices). These problems are natural generalisations of the Longest Path problem. Our approach uses bidimensionality theory combined with novel dynamic programming techniques over branch decompositions of the input graph. These techniques can be applied to a more general family of problems that deal with finding connected subgraphs under certain degree constraints.

• Type: Journal
• Year: 2010
• Where: JDA
• Authors: Ignasi Sau, Dimitrios M. Thilikos
• Keywords: Certain Degree Constraints, JDA 2010, Longest Path Problem, Subexponential Parameterized Algorithms