Quickly excluding an annotated planar graph

TL;DR

This paper proves that the structure theorem for bidimensionality in planar graphs can be bounded polynomially, enhancing algorithmic applications for problems like Steiner Tree on such graphs.

Contribution

It establishes polynomial bounds for the structure theorem related to bidimensionality, extending previous results to annotated and apex-minor-free graphs.

Findings

Polynomial bounds for the structure theorem in planar graphs.

Application to Steiner Tree problem with efficient algorithms.

Extension of bounds to apex-minor-free graphs.

Abstract

We provide proofs certifying that the structure theorem for vertex sets of bounded bidimensionality holds with polynomial bounds. The bidimensionality of vertex sets is a common generalisation of both treewidth and the face-cover-number of vertex sets in planar graphs. As such, it plays a crucial role in extensions of Courcelle's Theorem to $H$-minor-free graphs. Recently, bidimensionality and similar parameters have emerged as key for extensions of known parameterized algorithms for problems defined on a terminal set $R$. A prominent example for such a problem is Steiner Tree, which admits efficient algorithms on planar graphs whenever $R$ can be covered with few faces. Key to the algorithmic applications of bidimensionality is a structure theorem that explains how a graph $G$ can be decomposed into pieces where the behaviour of $R$ is highly controlled. One may see this structure theorem as a rooted analogue of Robertson and Seymour's celebrated Grid Theorem. Combining recent advances in obtaining polynomial bounds in the Graph Minors framework with new techniques for handling annotated vertex sets, we show that all parameters in the structure theorem above admit polynomial bounds. As an application, we also provide a sketch showing how our techniques imply polynomial bounds for the structure theorem for graphs excluding an apex minor.