A Simpler Proof Of The Average Case Complexity Of Union-Find WithPath Compression
Description:
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.
Date:
April 28, 2005
Creator:
Wu, Kesheng & Otoo, Ekow
Item Type:
Refine your search to only
Report
Partner:
UNT Libraries Government Documents Department