Analysis of the total costs for variants of the Union-Find algorithm - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Discrete Mathematics and Theoretical Computer Science Année : 2007

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

Résumé

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
Origine : Fichiers éditeurs autorisés sur une archive ouverte
Loading...

Dates et versions

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

Identifiants

Citer

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

TDS-MACS
40 Consultations
450 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More