A deterministic polynomial kernel for Odd Cycle Transversal and Vertex Multiway Cut in planar graphs

10/02/2018
by   Bart M. P. Jansen, et al.
0

We show that Odd Cycle Transversal and Vertex Multiway Cut admit deterministic polynomial kernels when restricted to planar graphs and parameterized by the solution size. This answers a question of Saurabh. On the way to these results, we provide an efficient sparsification routine in the flavor of the sparsification routine used for the Steiner Tree problem in planar graphs (FOCS 2014). It differs from the previous work because it preserves the existence of low-cost subgraphs that are not necessarily Steiner trees in the original plane graph, but structures that turn into (supergraphs of) Steiner trees after adding all edges between pairs of vertices that lie on a common face. We also show connections between Vertex Multiway Cut and the Vertex Planarization problem, where the existence of a polynomial kernel remains an important open problem.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/02/2023

Two-sets cut-uncut on planar graphs

We study the following Two-Sets Cut-Uncut problem on planar graphs. Ther...
research
01/22/2023

On the size of maximum cut in planar graphs

We show that the size of maximum cut in a planar graph with m edges is a...
research
10/28/2021

A Framework for Parameterized Subexponential Algorithms for Generalized Cycle Hitting Problems on Planar Graphs

Subexponential parameterized algorithms are known for a wide range of na...
research
03/07/2019

Halin graphs are 3-vertex-colorable except even wheels

A Halin graph is a graph obtained by embedding a tree having no nodes of...
research
11/06/2018

Flow-Cut Gaps and Face Covers in Planar Graphs

The relationship between the sparsest cut and the maximum concurrent mul...
research
07/19/2018

When Do Gomory-Hu Subtrees Exist?

Gomory-Hu (GH) Trees are a classical sparsification technique for graph ...
research
07/02/2020

Multicommodity Flows in Planar Graphs with Demands on Faces

We consider the problem of multicommodity flows in planar graphs. Seymou...

Please sign up or login with your details

Forgot password? Click here to reset