Fast Minor Testing in Planar Graphs

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)

• Type: Conference
• Year: 2010
• Where: ESA
• Authors: Isolde Adler, Frederic Dorn, Fedor V. Fomin, Ignasi Sau, Dimitrios M. Thilikos
• Keywords: Algorithmic Graph Theory, Algorithms, ESA 2010, Numerous Graph Algorithms, Planar N-vertex Graph