On the complexity of the maximum common subgraph problem for partial \(k\)-trees of bounded degree (Q4909531)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the complexity of the maximum common subgraph problem for partial k-trees of bounded degree |
scientific article; zbMATH DE number 6147800
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.914330005645752
0 references
0.9094876050949096
0 references
0.9067666530609132
0 references
0.9035016298294068
0 references
