The complexity of subgraph isomorphism for classes of partial k-trees (Q671437): Difference between revisions
From MaRDI portal
m rollbackEdits.php mass rollback Tag: Rollback |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0304-3975(96)00046-1 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2073919081 / rank | |||
Normal rank | |||
Revision as of 19:04, 19 March 2024
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
