Planar vertex-disjoint cycle packing: new structures and improved kernel
Q Feng, X Liao, J Wang - International Conference on Combinatorial …, 2017 - Springer
Q Feng, X Liao, J Wang
International Conference on Combinatorial Optimization and Applications, 2017•SpringerAbstract The Maximum Cycle Packing problem is an important class of NP-hard problems,
which has lots of applications in many fields. In this paper, we study Parameterized Planar
Vertex-Disjoint Cycle Packing problem, which is to find k vertex-disjoint cycles in a given
planar graph. The current best kernel size for this problem is 1209 k-1317 1209 k-1317.
Based on properties of maximal cycle packing, small cycles, degree-2 paths, and new
reduction rules given, a kernel of size 415 k-814 415 k-814 is presented for Parameterized …
which has lots of applications in many fields. In this paper, we study Parameterized Planar
Vertex-Disjoint Cycle Packing problem, which is to find k vertex-disjoint cycles in a given
planar graph. The current best kernel size for this problem is 1209 k-1317 1209 k-1317.
Based on properties of maximal cycle packing, small cycles, degree-2 paths, and new
reduction rules given, a kernel of size 415 k-814 415 k-814 is presented for Parameterized …
Abstract
The Maximum Cycle Packing problem is an important class of NP-hard problems, which has lots of applications in many fields. In this paper, we study Parameterized Planar Vertex-Disjoint Cycle Packing problem, which is to find k vertex-disjoint cycles in a given planar graph. The current best kernel size for this problem is . Based on properties of maximal cycle packing, small cycles, degree-2 paths, and new reduction rules given, a kernel of size is presented for Parameterized Planar Vertex-Disjoint Cycle Packing problem.
Springer
Showing the best result for this search. See all results