A potential-based amortized analysis of the union-find data structure

The blob code is competitive with edge-sets in genetic algorithms for the minimum routing cost spanning tree problem

GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
Determination of maximally stable extremal regions in large images

SPPRA '08 Proceedings of the Fifth IASTED International Conference on Signal Processing, Pattern Recognition and Applications

Hi-index	0.00

We present a simple, new potential-based amortized analysis for the standard union-find data structure.