A lower bound on the single-operation worst-case time complexity of the union-find problem on intervals (Q1332777)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 633516
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A lower bound on the single-operation worst-case time complexity of the union-find problem on intervals |
scientific article; zbMATH DE number 633516 |
Statements
A lower bound on the single-operation worst-case time complexity of the union-find problem on intervals (English)
0 references
5 September 1994
0 references
analysis of algorithms
0 references
data structures
0 references
0 references
0.9103853106498718
0 references
0.8204864263534546
0 references
0.8192447423934937
0 references
0.8112039566040039
0 references
