New kernels for several problems on planar graphs
Theoretical Computer Science, pp. 587-594, 2020.
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
Get fulltext within 24h
Full Text (Upload PDF)
PPT (Upload PPT)