Probabilistic Analysis of Disjoint Set Union Algorithms

DOI10.1137/0222064MaRDI QIDQ3142595zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Béla Bollobás, Istvan Simon

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

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

Recommendations

• A randomized concurrent algorithm for disjoint set union
• A probabilistic distributed algorithm for set intersection and its analysis
• scientific article; zbMATH DE number 3911705
• The complexity of unions of disjoint sets
• The Complexity of Unions of Disjoint Sets
• Worst-case Analysis of Set Union Algorithms
• Disjoint set union with randomized linking
• Approximate set union via approximate randomization
• Approximate set union via approximate randomization
• scientific article; zbMATH DE number 4099049

Cited in

(14)

• Worst-case Analysis of Set Union Algorithms
• A randomized concurrent algorithm for disjoint set union
• Disjoint set union with randomized linking
• Stochastic coalescence in logarithmic time
• Note on the structure of Kruskal's algorithm
• Recognizing union-find trees is NP-complete, even without rank info
• Analysis of the total costs for variants of the union-find algorithm
• On the Expected Performance of Path Compression Algorithms
• Stochastic coalescence in logarithmic time
• scientific article; zbMATH DE number 3911705 (Why is no real title available?)
• Memory management for union-find algorithms
• Amortized Analysis of Algorithms for Set Union with Backtracking
• Concurrent disjoint set union
• Efficient union-find for planar graphs and other sparse graph classes (extended abstract)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3142595)