On the Complexity of Finding a Largest Common Subtree of Bounded Degree - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Tatsuya Akutsu, Takeyuki Tamura, Avraham A. Melkman, Atsuhiro Takasu. On the Complexity of Finding a Largest Common Subtree of Bounded Degree. In Leszek Gasieniec, Frank Wolter, editors, Fundamentals of Computation Theory - 19th International Symposium, FCT 2013, Liverpool, UK, August 19-21, 2013. Proceedings. Volume 8070 of Lecture Notes in Computer Science, pages 4-15, Springer, 2013. [doi]

This author has not been identified. Look up 'Tatsuya Akutsu' in GoogleThis author has not been identified. Look up 'Takeyuki Tamura' in GoogleThis author has not been identified. Look up 'Avraham A. Melkman' in GoogleThis author has not been identified. Look up 'Atsuhiro Takasu' in Google

runs on WebDSL