A Simpler Proof Of The Average Case Complexity Of Union-Find WithPath Compression
We present a modified union-find algorithm that represent the data in an array rather than the commonly used pointer-based data structures, and a simpler proof that the average case complexity of the union-find algorithm is linear.
- Research Organization:
- Lawrence Berkeley National Lab. (LBNL), Berkeley, CA (United States)
- Sponsoring Organization:
- USDOE Director. Office of Science. Office of AdvancedScientific Computing Research
- DOE Contract Number:
- DE-AC02-05CH11231
- OSTI ID:
- 877676
- Report Number(s):
- LBNL-57527; R&D Project: KS3310; BnR: KJ0101030; TRN: US200607%%349
- Country of Publication:
- United States
- Language:
- English
Similar Records
Investigations of Beam Dynamics Issues at Current and Future Hadron Accelerators (Final Report)
A Testbed of Parallel Kernels for Computer Science Research
Report on activities and findings under DOE grant “Collaborative research. An Interactive Multi-Model for Consensus on Climate Change”
Technical Report
·
Thu Mar 12 00:00:00 EDT 2015
·
OSTI ID:877676
+1 more
A Testbed of Parallel Kernels for Computer Science Research
Technical Report
·
Fri Apr 30 00:00:00 EDT 2010
·
OSTI ID:877676
+6 more
Report on activities and findings under DOE grant “Collaborative research. An Interactive Multi-Model for Consensus on Climate Change”
Technical Report
·
Fri Oct 30 00:00:00 EDT 2015
·
OSTI ID:877676
+1 more