Login / Signup
On the complexity of finding a largest common subtree of bounded degree.
Tatsuya Akutsu
Takeyuki Tamura
Avraham A. Melkman
Atsuhiro Takasu
Published in:
Theor. Comput. Sci. (2015)
Keyphrases
</>
worst case
computational complexity
bounded treewidth
database
labeled data
partial order
graph theoretic
bounded degree