Improved Hardness of Maximum Common Subgraph Problems on Labeled Graphs of Bounded Treewidth and Bounded Degree

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

Abstract is missing.