Linear-vertex kernel for the problem of packing \(r\)-stars into a graph without long induced paths

DOI10.1016/j.ipl.2016.01.007zbMath1357.05121arXiv1510.03564OpenAlexW2245515622MaRDI QIDQ264204

F. Blanchet-Sadri, M. Dambrine

Publication date: 6 April 2016

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1510.03564

zbMATH Keywords

starspackingkernelgraph algorithmsfixed-parameter tractability

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

The maximum 4-vertex-path packing of a cubic graph covers at least two-thirds of its vertices, Kernels for packing and covering problems

Cites Work

• Fundamentals of parameterized complexity
• A generalization of Nemhauser and Trotter's local optimization theorem
• Looking at the stars
• Kernelization – Preprocessing with a Guarantee
• An Improved Parameterized Algorithm for a Generalized Matching Problem
• On the completeness of a generalized matching problem
• Parameterized Algorithms
• Graph-Theoretic Concepts in Computer Science
• Unnamed Item
• Unnamed Item
• Unnamed Item