Union-Find with Constant Time Deletions

DOI10.1145/2636922zbMath1398.68101OpenAlexW1974993532WikidataQ60554408 ScholiaQ60554408MaRDI QIDQ4962164

Inge Li Gørtz, Stephen Alstrup, Mikkel Thorup, Theis Rauhe, Uri Zwick

Publication date: 30 October 2018

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2636922

zbMATH Keywords

union-finddisjoint sets

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Data structures (68P05)

Related Items (2)

Machine-Checked Verification of the Correctness and Amortized Complexity of an Efficient Union-Find Implementation ⋮ Verifying the correctness and amortized complexity of a union-find implementation in separation logic with time credits

This page was built for publication: Union-Find with Constant Time Deletions