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]
Possibly Related PublicationsThe following publications are possibly variants of this publication: On the Complexity of the Maximum Common Subgraph Problem for Partial k-Trees of Bounded DegreeTatsuya Akutsu, Takeyuki Tamura. isaac 2012: 146-155 [doi] A Polynomial-Time Algorithm for Computing the Maximum Common Connected Edge Subgraph of Outerplanar Graphs of Bounded DegreeTatsuya Akutsu, Takeyuki Tamura. algorithms, 6(1):119-135, 2013. [doi] A Polynomial-Time Algorithm for Computing the Maximum Common Subgraph of Outerplanar Graphs of Bounded DegreeTatsuya Akutsu, Takeyuki Tamura. mfcs 2012: 76-87 [doi]
The following publications are possibly variants of this publication: