Kernelization and parameterized algorithms for covering a tree by a set of stars or paths

DOI10.1016/j.tcs.2015.06.030zbMath1332.68093MaRDI QIDQ897955

Qilong Feng, Jianxin Wang, Feng Shi, Jie You

Publication date: 8 December 2015

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2015.06.030

zbMATH Keywords

graph covering; graph packing; fixed-parameter tractable

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

05C85: Graph algorithms (graph-theoretic aspects)