Improved Hardness of Maximum Common Subgraph Problems on Labeled Graphs of Bounded Treewidth and Bounded Degree (Q5859738)
From MaRDI portal
scientific article; zbMATH DE number 7335382
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Improved Hardness of Maximum Common Subgraph Problems on Labeled Graphs of Bounded Treewidth and Bounded Degree |
scientific article; zbMATH DE number 7335382 |
Statements
Improved Hardness of Maximum Common Subgraph Problems on Labeled Graphs of Bounded Treewidth and Bounded Degree (English)
0 references
20 April 2021
0 references
maximum common subgraph
0 references
partial \(k\)-tree
0 references
treewidth
0 references
NP-hardness
0 references
0 references
0 references
0 references
0 references
0 references
