Recognizing union-find trees is NP-complete (Q1685019)
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: Recognizing union-find trees is NP-complete |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Recognizing union-find trees is NP-complete |
scientific article |
Statements
Recognizing union-find trees is NP-complete (English)
0 references
13 December 2017
0 references
union-find trees
0 references
complexity
0 references
NP-completeness
0 references
data structures
0 references
union-by-size
0 references
0 references
0.9773160815238952
0 references
0.9628907442092896
0 references
0.8393381834030151
0 references
0.8376964330673218
0 references
0.7370144724845886
0 references
