Skip to Main content Skip to Navigation
Conference papers

Analysis of the total costs for variants of the Union-Find algorithm

Markus Kuba 1 Alois Panholzer 1
1 Institut für Diskrete Mathematik und Geometrie [Wien]
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.
Keywords : Union-Find algorithm average-case analysis limiting distribution
Document type :
Conference papers
Complete list of metadata

Cited literature [10 references]  Display  Hide  Download
https://hal.inria.fr/hal-01184783
Contributor : Coordination Episciences Iam <>
Submitted on : Monday, August 17, 2015 - 4:59:32 PM
Last modification on : Thursday, May 11, 2017 - 1:02:51 AM
Long-term archiving on: : Wednesday, November 18, 2015 - 12:16:31 PM

File

Vignette du document
dmAH0119.pdf
Publisher files allowed on an open archive

Identifiers

  • HAL Id : hal-01184783, version 1

Collections

INSMI | TDS-MACS

Citation

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. ⟨hal-01184783⟩

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Record views

87

Files downloads

497

 

Contact                    Legal Notice                    Personal Data