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
Type de document :
Communication dans un congrès
Jacquet, Philippe. 2007 Conference on Analysis of Algorithms, AofA 07, 2007, Juan les Pins, France. Discrete Mathematics and Theoretical Computer Science, DMTCS Proceedings vol. AH, 2007 Conference on Analysis of Algorithms (AofA 07), pp.283-294, 2007, DMTCS Proceedings
Liste complète des métadonnées

Littérature citée [10 références]  Voir  Masquer  Télécharger
https://hal.inria.fr/hal-01184783
Contributeur : Coordination Episciences Iam <>
Soumis le : lundi 17 août 2015 - 16:59:32
Dernière modification le : jeudi 11 mai 2017 - 01:02:51
Document(s) archivé(s) le : mercredi 18 novembre 2015 - 12:16:31

Fichier

dmAH0119.pdf
Fichiers éditeurs autorisés sur une archive ouverte

Identifiants

  • 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. Jacquet, Philippe. 2007 Conference on Analysis of Algorithms, AofA 07, 2007, Juan les Pins, France. Discrete Mathematics and Theoretical Computer Science, DMTCS Proceedings vol. AH, 2007 Conference on Analysis of Algorithms (AofA 07), pp.283-294, 2007, DMTCS Proceedings. 〈hal-01184783〉

Exporter

BibTeX TEI DC DCterms EndNote

Partager

Métriques

Consultations de la notice

64

Téléchargements de fichiers

155

Contact


archive-ouverte@inria.fr