New kernels for several problems on planar graphs

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

Theoretical Computer Science, pp. 587-594, 2020.

Cited by: 1|Views8
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 the Gallai-Edmonds decomposition structure, a kernel of size 26k is...More

Code:

Data:

Your rating :
0

 

Tags
Comments