The largest common subtree problem is to find a bijective mapping between subsets of nodes of two input rooted trees of maximum cardinality or weight that preserves labels and ancestry relationship. This problem is known to be NP-hard for unordered trees. In this paper, we consider a restricted unordered case in which the maximum outdegree of a common subtree is bounded by a constant D. We present an O(nD) time algorithm where n is the maximum size of two input trees, which improves a previous O(n2D) time algorithm. We also prove that this restricted problem is W[1]-hard for parameter D. © 2013 Springer-Verlag.
CITATION STYLE
Akutsu, T., Tamura, T., Melkman, A. A., & Takasu, A. (2013). On the complexity of finding a largest common subtree of bounded degree. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8070 LNCS, pp. 4–15). https://doi.org/10.1007/978-3-642-40164-0_4
Mendeley helps you to discover research relevant for your work.