Analysis of the total costs for variants of the Union-Find algorithm
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''...
| Published in: | Discrete Mathematics & Theoretical Computer Science |
|---|---|
| Main Authors: | , |
| Format: | Article |
| Language: | English |
| Published: |
Discrete Mathematics & Theoretical Computer Science
2007-01-01
|
| Subjects: | |
| Online Access: | https://dmtcs.episciences.org/3535/pdf |