On the Single-Operation Worst-Case Time Complexity of the Disjoint Set Union Problem (Q3756517)
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: On the Single-Operation Worst-Case Time Complexity of the Disjoint Set Union Problem |
scientific article; zbMATH DE number 4005611
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the Single-Operation Worst-Case Time Complexity of the Disjoint Set Union Problem |
scientific article; zbMATH DE number 4005611 |
Statements
On the Single-Operation Worst-Case Time Complexity of the Disjoint Set Union Problem (English)
0 references
1986
0 references
data structure
0 references
time complexity
0 references
lower bound
0 references
algorithm
0 references
disjoint set union problem
0 references
0 references
0.91310954
0 references
0.91091275
0 references
0.91091275
0 references
0.9064566
0 references
0.88381326
0 references
0.8793228
0 references
