Abstract
Path compression is used in a number of algorithms, most notably in various very natural solutions to the so-called Union-Find problem. This problem is basic and important enough to be covered in most introductory courses and textbooks on algorithms and data structures. However the performance analysis of the solutions is more often than not at best incomplete if not omitted altogether. Already the definition of the function α, the interesting constituent of the time bound, as a quasi inverse of the Ackermann function is complicated and not easy to understand.
Similar content being viewed by others
References
Seidel, R., Sharir, M.: Top-Down Analysis of Path Compression. SIAM J. Comput. 34, 515–525 (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Seidel, R. (2006). Top-Down Analysis of Path Compression: Deriving the Inverse-Ackermann Bound Naturally (and Easily). In: Arge, L., Freivalds, R. (eds) Algorithm Theory – SWAT 2006. SWAT 2006. Lecture Notes in Computer Science, vol 4059. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11785293_1
Download citation
DOI: https://doi.org/10.1007/11785293_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-35753-7
Online ISBN: 978-3-540-35755-1
eBook Packages: Computer ScienceComputer Science (R0)