On the complexity of finding iso- and other morphisms for partial \(k\)- trees (Q1201267)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the complexity of finding iso- and other morphisms for partial \(k\)- trees |
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
