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]
@article{AkutsuMT20,
title = {Improved Hardness of Maximum Common Subgraph Problems on Labeled Graphs of Bounded Treewidth and Bounded Degree},
author = {Tatsuya Akutsu and Avraham A. Melkman and Takeyuki Tamura},
year = {2020},
doi = {10.1142/S0129054120500069},
url = {https://doi.org/10.1142/S0129054120500069},
researchr = {https://researchr.org/publication/AkutsuMT20},
cites = {0},
citedby = {0},
journal = {Int. J. Found. Comput. Sci.},
volume = {31},
number = {2},
pages = {253-273},
}