eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Leibniz International Proceedings in Informatics
1868-8969
2016-06-22
4:1
4:14
10.4230/LIPIcs.SWAT.2016.4
article
A Linear Kernel for Finding Square Roots of Almost Planar Graphs
Golovach, Petr A.
Kratsch, Dieter
Paulusma, Daniël
Stewart, Anthony
A graph H is a square root of a graph G if G can be obtained from H by the addition of edges between any two vertices in H that are of distance 2 of each other. The Square Root problem is that of deciding whether a given graph admits a square root. We consider this problem for planar graphs in the context of the "distance from triviality" framework. For an integer k, a planar+kv graph is a graph that can be made planar by the removal of at most k vertices. We prove that the generalization of Square Root, in which we are given two subsets of edges prescribed to be in or out of a square root, respectively, has a kernel of size O(k) for planar+kv graphs, when parameterized by k. Our result is based on a new edge reduction rule which, as we shall also show, has a wider applicability for the Square Root problem.
https://drops.dagstuhl.de/storage/00lipics/lipics-vol053-swat2016/LIPIcs.SWAT.2016.4/LIPIcs.SWAT.2016.4.pdf
planar graphs
square roots
linear kernel