Recognizing union-find trees is NP-complete, even without rank info (Q5205041)
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, even without rank info |
scientific article; zbMATH DE number 7141922
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.9834619164466858
0 references
0.9773160815238952
0 references
0.8421839475631714
0 references
0.8402044773101807
0 references
0.7232125997543335
0 references
