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 the normal view instead:
scientific article; zbMATH DE number 97514
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of finding iso- and other morphisms for partial \(k\)- trees |
scientific article; zbMATH DE number 97514 |
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
0.8630499243736267
0 references
0.8409733176231384
0 references
0.8407806754112244
0 references
0.8374179601669312
0 references
