On the complexity of finding iso- and other morphisms for partial \(k\)- trees (Q1201267): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 02:30, 5 March 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
