DOAJ Open Access 2007

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

Markus Kuba Alois Panholzer

Lihat Sumber DOI

Abstrak

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.

Topik & Kata Kunci

Mathematics

Penulis (2)

Markus Kuba

Alois Panholzer

Format Sitasi

APA MLA BibTeX

Kuba, M., Panholzer, A. (2007). Analysis of the total costs for variants of the Union-Find algorithm. https://doi.org/10.46298/dmtcs.3535

Akses Cepat

Lihat di Sumber doi.org/10.46298/dmtcs.3535

Informasi Jurnal

Tahun Terbit: 2007
Sumber Database: DOAJ
DOI: 10.46298/dmtcs.3535
Akses: Open Access ✓