Fast Minor Testing in Planar Graphs

Abstract : Minor containment is a fundamental problem in Algorithmic Graph Theory, as numerous graph algorithms use it as a subroutine. A model of a graph H in a graph G is a set of disjoint connected subgraphs of G indexed by the vertices of H, such that if {u, v} is an edge of H, then there is an edge of G between components Cu and Cv. Graph H is a minor of G if G contains a model of H as a subgraph. We give an algorithm that, given a planar n-vertex graph G and an h-vertex graph H, either finds in time 2O(h)ċn+O(n2ċlog n) a model of H in G, or correctly concludes that G does not contain H as a minor. Our algorithm is the first single-exponential algorithm for this problem and improves all previous minor testing algorithms in planar graphs. Our technique is based on a novel approach called partially embedded dynamic programming.
Type de document :
Communication dans un congrès
ESA'10: 18th Annual European Symposium on Algorithms, United Kingdom. pp.97-109, 2010, LNCS
Liste complète des métadonnées

https://hal-lirmm.ccsd.cnrs.fr/lirmm-00736769
Contributeur : Ignasi Sau <>
Soumis le : samedi 29 septembre 2012 - 16:15:02
Dernière modification le : jeudi 24 mai 2018 - 15:59:22

Identifiants

  • HAL Id : lirmm-00736769, version 1

Collections

Citation

Isolde Adler, Frederic Dorn, Fedor V. Fomin, Ignasi Sau, Dimitrios M. Thilikos. Fast Minor Testing in Planar Graphs. ESA'10: 18th Annual European Symposium on Algorithms, United Kingdom. pp.97-109, 2010, LNCS. 〈lirmm-00736769〉

Partager

Métriques

Consultations de la notice

72