Abstract
We study two restricted versions of the Subforest Isomorphism problem, the Star-Cover of a Tree (SCT) and the Path-Cover of a Tree (PCT) problems. Both problems are NP-complete. The problems are closely related to a number of well-studied problems, including the problems Subgraph Isomorphism, Tree Editing, and Graph Packing. We show that the problems SCT and PCT are fixed-parameter tractable. Thorough development of parameterized algorithms and kernelization algorithms for these problems are presented. © 2014 Springer International Publishing.
Cite
CITATION STYLE
You, J., Feng, Q., Guo, J., & Shi, F. (2014). On star-cover and path-cover of a tree. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8497 LNCS, pp. 298–308). Springer Verlag. https://doi.org/10.1007/978-3-319-08016-1_27
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
