On the complexity of finding iso- and other morphisms for partial \(k\)- trees (Q1201267): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 07:04, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of finding iso- and other morphisms for partial \(k\)- trees |
scientific article |
Statements
On the complexity of finding iso- and other morphisms for partial \(k\)- trees (English)
0 references
17 January 1993
0 references
partial \(k\)-tree
0 references
NP-complete
0 references
complexity
0 references
polynomial algorithms
0 references
