Papers
Topics
Authors
Recent
Search
2000 character limit reached

Hitting Topological Minor Models in Planar Graphs is Fixed Parameter Tractable

Published 5 Jul 2019 in cs.DS and math.CO | (1907.02919v4)

Abstract: For a finite collection of graphs F{\cal F}, the \textsc{F{\cal F}-TM-Deletion} problem has as input an nn-vertex graph GG and an integer kk and asks whether there exists a set S⊆V(G)S \subseteq V(G) with ∣S∣≤k|S| \leq k such that G∖SG \setminus S does not contain any of the graphs in F{\cal F} as a topological minor. We prove that for every such F{\cal F}, \textsc{F{\cal F}-TM-Deletion} is fixed parameter tractable on planar graphs. Our algorithm runs in a 2O(k2)⋅n22^{\mathcal{O}(k^2)}\cdot n^{2} time or, alternatively in 2O(k)⋅n42^{\mathcal{O}(k)}\cdot n^{4} time. Our techniques can easily be extended to graphs that are embeddable on any fixed surface.

Citations (15)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.