descriptionPublicationkeyboard_double_arrow_right Report , Other literature type 28 Apr 2005Publisher:Office of Scientific and Technical Information (OSTI)

Authors: Wu, Kesheng; Otoo, Ekow;

doi: 10.2172/877676

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

- Summary
- Subjects
- Metrics

Abstract

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.

Related Organizations

University of North Texas
United States
University of North Texas System
United States
Lawrence Berkeley National Laboratory
United States

Keywords

And Information Science, Computing, Union-Find Algorithms Analysis Of Algorithms Average Casecomplexity, 99 General And Miscellaneous//Mathematics, Algorithms, Data Analysis Union-Find Algorithms Analysis Of Algorithms Average Casecomplexity, Calculation Methods

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	1
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Average
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average