Analysis of the total costs for variants of the Union-Find algorithm - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Discrete Mathematics and Theoretical Computer Science Year : 2007

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.
Fichier principal
Vignette du fichier
dmAH0119.pdf (223.4 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive
Loading...

Dates and versions

hal-01184783 , version 1 (17-08-2015)

Identifiers

Cite

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⟩

Collections

INSMI TDS-MACS
36 View
380 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More