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

Tatsuya Akutsu, Avraham A. Melkman, Takeyuki Tamura

Research output: Contribution to journalArticlepeer-review

Fingerprint

Dive into the research topics of 'Improved Hardness of Maximum Common Subgraph Problems on Labeled Graphs of Bounded Treewidth and Bounded Degree'. Together they form a unique fingerprint.

Engineering & Materials Science