On the Complexity of the Maximum Common Subgraph Problem for Partial k-Trees of Bounded Degree (Q4909531)
From MaRDI portal
scientific article; zbMATH DE number 6147800
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the Complexity of the Maximum Common Subgraph Problem for Partial k-Trees of Bounded Degree |
scientific article; zbMATH DE number 6147800 |
Statements
On the Complexity of the Maximum Common Subgraph Problem for Partial k-Trees of Bounded Degree (English)
0 references
21 March 2013
0 references
maximum common subgraph
0 references
partial \(k\)-tree
0 references
treewidth
0 references
NP-hard
0 references
