 |
Discrete Mathematics & Theoretical Computer Science |
Markus Kuba ; Alois Panholzer - Analysis of the total costs for variants of the Union-Find algorithm
dmtcs:3535 - Discrete Mathematics & Theoretical Computer Science, January 1, 2007, DMTCS Proceedings vol. AH, 2007 Conference on Analysis of Algorithms (AofA 07) - https://doi.org/10.46298/dmtcs.3535Analysis of the total costs for variants of the Union-Find algorithmArticle
- 1 Institut für Diskrete Mathematik und Geometrie [Wien]
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.
Source: HAL:hal-01184783v1
Volume: DMTCS Proceedings vol. AH, 2007 Conference on Analysis of Algorithms (AofA 07)
Section: Proceedings
Published on: January 1, 2007
Imported on: May 10, 2017
Keywords: Union-Find algorithm,average-case analysis,limiting distribution,[INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS],[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM],[MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO],[INFO.INFO-CG] Computer Science [cs]/Computational Geometry [cs.CG]
Consultation statistics
This page has been seen 213 times.
This article's PDF has been downloaded 149 times.