Improved Kernels for Several Problems on Planar Graphs

Beilin Zhuo
Beilin Zhuo
Guanlan Tan
Guanlan Tan
Neng Huang
Neng Huang

Lecture Notes in Computer Science, pp. 169-180, 2018.

Cited by: 0|Views12
EI

Abstract:

In this paper, we study the kernelization of the Induced Matching problem on planar graphs, the Parameterized Planar 4-Cycle Transversal problem and the Parameterized Planar Edge-Disjoint 4-Cycle Packing problem. For the Induced Matching problem on planar graphs, based on Gallai-Edmonds structure, a kernel of size 26k is presented, which ...More

Code:

Data:

Get fulltext within 24h
Bibtex
Your rating :
0

 

Tags
Comments