A Deterministic Polynomial Kernel for Odd Cycle Transversal and Vertex Multiway Cut in Planar Graphs

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...

[1]  Anders Yeo,et al.  Kernel bounds for disjoint cycles and disjoint paths , 2009, Theor. Comput. Sci..

[2]  Saket Saurabh,et al.  Uniform Kernelization Complexity of Hitting Forbidden Minors , 2015, ICALP.

[3]  Robert E. Tarjan,et al.  Efficient Planarity Testing , 1974, JACM.

[4]  Clyde L. Monma,et al.  Send-and-Split Method for Minimum-Concave-Cost Network Flows , 1987, Math. Oper. Res..

[5]  Michal Pilipczuk,et al.  On multiway cut parameterized above lower bounds , 2011, TOCT.

[6]  Erik Jan van Leeuwen,et al.  Network Sparsification for Steiner Problems on Planar and Bounded-Genus Graphs , 2013, 2014 IEEE 55th Annual Symposium on Foundations of Computer Science.

[7]  Michael R. Fellows,et al.  On problems without polynomial kernels , 2009, J. Comput. Syst. Sci..

[8]  Mihalis Yannakakis,et al.  Multiway cuts in node weighted graphs , 2004, J. Algorithms.

[9]  F. Hadlock,et al.  Finding a Maximum Cut of a Planar Graph in Polynomial Time , 1975, SIAM J. Comput..

[10]  Dieter van Melkebeek,et al.  Satisfiability Allows No Nontrivial Sparsification unless the Polynomial-Time Hierarchy Collapses , 2014, JACM.

[11]  Andrew Drucker.  New Limits to Classical and Quantum Instance Compression , 2015, SIAM J. Comput..

[12]  Dániel Marx,et al.  Obtaining a Planar Graph by Vertex Deletion , 2007, Algorithmica.

[13]  Ondrej Suchý.  Extending the Kernel for Planar Steiner Tree to the Number of Steiner Vertices , 2016, Algorithmica.

[14]  Sylvain Guillemot,et al.  FPT algorithms for path-transversal and cycle-transversal problems , 2011, Discret. Optim..

[15]  Bruce A. Reed,et al.  Planar graph bipartization in linear time , 2008, Discret. Appl. Math..

[16]  Lance Fortnow,et al.  Infeasibility of instance compression and succinct PCPs for NP , 2011, J. Comput. Syst. Sci..

[17]  Stefan Kratsch,et al.  Compression via Matroids: A Randomized Polynomial Kernel for Odd Cycle Transversal , 2011, TALG.