A Simpler Proof Of The Average Case Complexity Of Union-Find WithPath Compression

A Simpler Proof Of The Average Case Complexity Of Union-Find WithPath Compression [electronic resource]

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.

Saved in:
Bibliographic Details
Online Access: Online Access
Corporate Author: Lawrence Berkeley National Laboratory (Researcher)
Format: Government Document Electronic eBook
Language:English
Published: Berkeley, Calif. : Oak Ridge, Tenn. : Lawrence Berkeley National Laboratory ; distributed by the Office of Scientific and Technical Information, U.S. Dept. of Energy, 2005.
Subjects:
Data Analysis.
Algorithms.
Calculation Methods.
General And Miscellaneous//mathematics, Computing, And Information Science.

Internet

Online Access

Online

Holdings details from Online
Call Number: E 1.99:lbnl--57527
E 1.99:lbnl--57527 Available

Similar Items