The complexity of subgraph isomorphism for classes of partial k-trees (Q671437)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of subgraph isomorphism for classes of partial k-trees |
scientific article |
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
