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]
@inproceedings{AkutsuTMT13,
title = {On the Complexity of Finding a Largest Common Subtree of Bounded Degree},
author = {Tatsuya Akutsu and Takeyuki Tamura and Avraham A. Melkman and Atsuhiro Takasu},
year = {2013},
doi = {10.1007/978-3-642-40164-0_4},
url = {http://dx.doi.org/10.1007/978-3-642-40164-0_4},
researchr = {https://researchr.org/publication/AkutsuTMT13},
cites = {0},
citedby = {0},
pages = {4-15},
booktitle = {Fundamentals of Computation Theory - 19th International Symposium, FCT 2013, Liverpool, UK, August 19-21, 2013. Proceedings},
editor = {Leszek Gasieniec and Frank Wolter},
volume = {8070},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-642-40163-3},
}