On the complexity of finding a largest common subtree of bounded degree

Tatsuya Akutsu, Takeyuki Tamura, Avraham A. Melkman, Atsuhiro Takasu

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

2 Scopus citations

Abstract

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.

Original languageEnglish
Title of host publicationFundamentals of Computation Theory - 19th International Symposium, FCT 2013, Proceedings
Pages4-15
Number of pages12
DOIs
StatePublished - 3 Sep 2013
Event19th International Symposium on Fundamentals of Computation Theory, FCT 2013 - Liverpool, United Kingdom
Duration: 19 Aug 201321 Aug 2013

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume8070 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference19th International Symposium on Fundamentals of Computation Theory, FCT 2013
Country/TerritoryUnited Kingdom
CityLiverpool
Period19/08/1321/08/13

Keywords

  • dynamic programming
  • parameterized complexity
  • tree edit distance
  • unordered trees

Fingerprint

Dive into the research topics of 'On the complexity of finding a largest common subtree of bounded degree'. Together they form a unique fingerprint.

Cite this