Recognizing union-find trees is NP-complete (Q1685019)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
