Probabilistic Analysis of Disjoint Set Union Algorithms

DOI10.1137/0222064zbMath0789.68069OpenAlexW2019579910WikidataQ60142441 ScholiaQ60142441MaRDI QIDQ3142595

Istvan Simon, Béla Bollobás

Publication date: 13 June 1994

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0222064

zbMATH Keywords

random graphsexpected running timeunion-find problemweighted quick-find algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10)

Related Items (3)

Note on the structure of Kruskal's algorithm ⋮ Stochastic coalescence in logarithmic time ⋮ Unnamed Item

This page was built for publication: Probabilistic Analysis of Disjoint Set Union Algorithms