Linear-Vertex Kernel for the Problem of Packing r-Stars into a Graph without Long Induced Paths

@article{Barbero2016LinearVertexKF,
  title={Linear-Vertex Kernel for the Problem of Packing r-Stars into a Graph without Long Induced Paths},
  author={Florian Barbero and Gregory Gutin and Mark Jones and Bin Sheng and Anders Yeo},
  journal={Inf. Process. Lett.},
  year={2016},
  volume={116},
  pages={433-436}
}
Let integers r ≥ 2 and d ≥ 3 be fixed. Let Gd be the set of graphs with no induced path on d vertices. We study the problem of packing k vertex-disjoint copies of K1,r (k ≥ 2) into a graph G from parameterized preprocessing, i.e., kernelization, point of view. We show that every graph G ∈ Gd can be reduced, in polynomial time, to a graph G′ ∈ Gd with O(k… CONTINUE READING