| HAL-Inria | Publications, software ... of Inria's scientists |
Conference papers
Analysis of the total costs for variants of the Union-Find algorithm
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.
Cited literature [10 references]
https://hal.inria.fr/hal-01184783
Contributor : Coordination Episciences Iam Connect 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
Contributor : Coordination Episciences Iam Connect 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
File
dmAH0119.pdf
Publisher files allowed on an open archive