Covering Tree with Stars

DOI10.1007/978-3-642-38768-5_34zbMath1381.68220OpenAlexW2276036272WikidataQ62779997 ScholiaQ62779997MaRDI QIDQ4925253

Rashid Ibragimov, Jiong Guo, Jan Baumbach

Publication date: 11 June 2013

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-38768-5_34

zbMATH Keywords

dynamic programmingNP-completenessgraph algorithmstree edit distance

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (2)

Kernelization and parameterized algorithms for covering a tree by a set of stars or paths ⋮ Fixed-parameter tractability for the Tree Assembly problem

This page was built for publication: Covering Tree with Stars