On the complexity of finding a largest common subtree of...

Theoretical Computer Science 2015 / 07 Vol. 590

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

Akutsu, Tatsuya, Tamura, Takeyuki, Melkman, Avraham A., Takasu, Atsuhiro
How much do you like this book?
What’s the quality of the file?
Download the book for quality assessment
What’s the quality of the downloaded files?
Volume:
590
Language:
english
Journal:
Theoretical Computer Science
DOI:
10.1016/j.tcs.2014.10.012
Date:
July, 2015
File:
PDF, 736 KB
english, 2015
Conversion to is in progress
Conversion to is failed