# Fast Minor Testing in Planar Graphs

@article{Adler2011FastMT,
title={Fast Minor Testing in Planar Graphs},
author={Isolde Adler and F. Dorn and F. Fomin and Ignasi Sau and D. Thilikos},
journal={Algorithmica},
year={2011},
volume={64},
pages={69-84}
}
Minor Containment is a fundamental problem in Algorithmic Graph Theory used as a subroutine in numerous graph algorithms. 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. A 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… Expand
14 Citations
2 Subexponential Time Algorithms for Embedding H-Minor Free Graphs
We establish the complexity of several graph embedding problems: Subgraph Isomorphism, Graph Minor, Induced Subgraph and Induced Minor, when restricted to H-minor free graphs. In each of theseExpand
Subexponential Time Algorithms for Embedding H-Minor Free Graphs
• Mathematics, Computer Science
• ICALP
• 2016
It is shown that, for any fixed graph H and epsilon > 0, if P is H-Minor Free and G has treewidth tw, (induced) subgraph can be solved in 2^{O(k^{epsilon}*tw+tw*log(tw)+k/log(k))}*n-O(1) time, and this solves an open problem on the complexity of Subgraph Isomorphism for planar graphs. Expand
Faster parameterized algorithms for minor containment
• Computer Science, Mathematics
• Theor. Comput. Sci.
• 2010
This work improves the dependence on k of Hicks' result by showing that checking if H is a minor of G can be done in time, and obtains the first single-exponential algorithm for minor containment testing. Expand
Efficient Graph Minors Theory and Parameterized Algorithms for (Planar) Disjoint Paths
• Mathematics, Computer Science
• Treewidth, Kernels, and Algorithms
• 2020
The above algorithm for Disjoint Paths is a cornerstone of the entire Graph Minors Theory, and conceptually vital to the $$g(k)n^3$$-time algorithm for Minor Testing (given two undirected graphs, G and H on n and k vertices, respectively, determine whether G contains H as a minor). Expand
Surface Split Decompositions and Subgraph Isomorphism in Graphs on Surfaces
• P. Bonsma
• Mathematics, Computer Science
• STACS
• 2012
The algorithm for the problem of counting and generating all subgraphs isomorphic to P is extended, even for the case where P is disconnected, which answers an open question by Eppstein (JGAA’99). Expand
The Parameterized Complexity of Graph Cyclability
• Mathematics, Computer Science
• ESA
• 2014