The complexity of subgraph isomorphism for classes of partial k-trees (Q671437)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 983301
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of subgraph isomorphism for classes of partial k-trees |
scientific article; zbMATH DE number 983301 |
Statements
The complexity of subgraph isomorphism for classes of partial k-trees (English)
0 references
27 February 1997
0 references
bounded tree-width graph
0 references
subgraph isomorphism problem
0 references
NP-complete
0 references
0.9324185848236084
0 references
0.8630499243736267
0 references
0.8445168137550354
0 references
0.8308795690536499
0 references
