Recognizing Union-Find Trees is NP-Complete, Even Without Rank Info (Q5205041)
From MaRDI portal
scientific article; zbMATH DE number 7141922
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Recognizing Union-Find Trees is NP-Complete, Even Without Rank Info |
scientific article; zbMATH DE number 7141922 |
Statements
Recognizing Union-Find Trees is NP-Complete, Even Without Rank Info (English)
0 references
10 December 2019
0 references
0 references
