Disjoint Set Union with Randomized Linking

DOI10.1137/1.9781611973402.75zbMATH Open1421.68027OpenAlexW4245889724MaRDI QIDQ5384037FDOQ5384037

Robert E. Tarjan, Ashish Goel, Daniel H. Larkin, Sanjeev Khanna

Publication date: 20 June 2019

Published in: Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Randomized algorithms (68W20) Analysis of algorithms (68W40) Data structures (68P05)

Cited In (4)

• A linear-time algorithm for a special case of disjoint set union
• Random linkage: A family of acceptance/rejection algorithms for global sation
• Probabilistic Analysis of Disjoint Set Union Algorithms
• Concurrent disjoint set union

This page was built for publication: Disjoint Set Union with Randomized Linking

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