Catalan structures and dynamic programming in H-minor-free graphs - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Journal Articles Journal of Computer and System Sciences Year : 2012

Catalan structures and dynamic programming in H-minor-free graphs

Abstract

We give an algorithm that, for a fixed graph H and integer k, decides whether an n-vertex H-minor-free graph G contains a path of length k in $2^(O(\sqrt{k})) n^{O(1)}$ steps. Our approach builds on a combination of Demaine-Hajiaghayiʼs bounds on the size of an excluded grid in such graphs with a novel combinatorial result on certain branch decompositions of H-minor-free graphs. This result is used to bound the number of ways vertex disjoint paths can be routed through the separators of such decompositions. The proof is based on several structural theorems from the Graph Minors series of Robertson and Seymour. With a slight modification, similar combinatorial and algorithmic results can be derived for many other problems. Our approach can be viewed as a general framework for obtaining time $2^(O(\sqrt{k})) n^{O(1)}$ algorithms on H-minor-free graph classes.

Dates and versions

lirmm-00904498 , version 1 (14-11-2013)

Identifiers

Cite

Frederic Dorn, Fedor V. Fomin, Dimitrios M. Thilikos. Catalan structures and dynamic programming in H-minor-free graphs. Journal of Computer and System Sciences, 2012, 78 (5), pp.1606-1622. ⟨10.1016/j.jcss.2012.02.004⟩. ⟨lirmm-00904498⟩
421 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More