Abstract : We study the average behavior of variants of the UNION-FIND algorithm to maintain partitions of a finite set under the random spanning tree model. By applying the method of moments we can characterize the limiting distribution of the total costs of the algorithms "Quick Find Weighted'' and "Quick Find Biased'' extending the analysis of Knuth and Schönhage, Yao, and Chassaing and Marchand.
https://hal.inria.fr/hal-01184783 Contributor : Coordination Episciences IamConnect in order to contact the contributor Submitted on : Monday, August 17, 2015 - 4:59:32 PM Last modification on : Wednesday, October 13, 2021 - 7:58:04 PM Long-term archiving on: : Wednesday, November 18, 2015 - 12:16:31 PM
Markus Kuba, Alois Panholzer. Analysis of the total costs for variants of the Union-Find algorithm. 2007 Conference on Analysis of Algorithms, AofA 07, 2007, Juan les Pins, France. pp.283-294, ⟨10.46298/dmtcs.3535⟩. ⟨hal-01184783⟩