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 presented, which improves the previous best result 28k. For the Parameterized Planar 4-Cycle Transversal problem, by partitioning the vertices in a given instance into several parts and analyzing the size of each part independently, a kernel with at most 51k−22 vertices is obtained, which improves the previous best result 74k. Based on the kernelization process of the Parameterized Planar 4-Cycle Transversal problem, a kernel of size 51k−22 can also be obtained for the Parameterized Planar Edge-Disjoint 4-Cycle Packing problem, which improves the previous best result 96k.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
