Filters








2 Hits in 5.4 sec

Preprocessing for Outerplanar Vertex Deletion: An Elementary Kernel of Quartic Size [article]

Huib Donkers, Bart M. P. Jansen, Michał Włodarczyk
2021 arXiv   pre-print
The class of outerplanar graphs is arguably the simplest class of graphs for which no explicit kernelization size bounds are known.  ...  In the ℱ-Minor-Free Deletion problem one is given an undirected graph G, an integer k, and the task is to determine whether there exists a vertex set S of size at most k, so that G-S contains no graph  ...  Now suppose that the algorithm was unable to apply Reduction Rule 3, i.e, for all 1 Preprocessing for Outerplanar Vertex Deletion: An Elementary Kernel of Quartic Size Proof.  ... 
arXiv:2110.01868v1 fatcat:qqtaxswxhbhixm6by7es4m3qaa

Preprocessing for Outerplanar Vertex Deletion: An Elementary Kernel of Quartic Size

Huib Donkers, Bart M. P. Jansen, Michał Włodarczyk, Petr A. Golovach, Meirav Zehavi
2021
The class of outerplanar graphs is arguably the simplest class of graphs for which no explicit kernelization size bounds are known.  ...  In the ℱ-Minor-Free Deletion problem one is given an undirected graph G, an integer k, and the task is to determine whether there exists a vertex set S of size at most k, so that G-S contains no graph  ...  This leads to a polynomial kernel for Planar-F Deletion on graphs with bounded degree since the I P E C 2 0 2 1 14:4 Preprocessing for Outerplanar Vertex Deletion size of the neighborhood of the modulator  ... 
doi:10.4230/lipics.ipec.2021.14 fatcat:4oiu3v5em5gobl3lezyrq3gtaq