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

Tatsuya Akutsu, Takeyuki Tamura, Avraham A. Melkman, Atsuhiro Takasu. On the complexity of finding a largest common subtree of bounded degree. Theoretical Computer Science, 590:2-16, 2015. [doi]

Abstract

Abstract is missing.