Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
Tatsuya Akutsu, Avraham A. Melkman, Takeyuki Tamura. Improved Hardness of Maximum Common Subgraph Problems on Labeled Graphs of Bounded Treewidth and Bounded Degree. Int. J. Found. Comput. Sci., 31(2):253-273, 2020. [doi]
Abstract is missing.