Corrigendum to ``A simple and efficient union-find-delete algorithm

DOI10.1016/J.TCS.2011.12.074MaRDI QIDQ418009zbMATH OpenOpenAlexFDO

Authors Amir M. Ben-Amram, Simon Yoffe

Publication date 14 May 2012

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2011.12.074

Mathematics Subject Classification ID

Data structures (68P05)

Recommendations

• A simple and efficient union-find-delete algorithm
• Automata, Languages and Programming
• Union-find with constant time deletions
• Corrections to ``Finding dominators via disjoint set union
• Corrigendum to ``Improving the computational efficiency of metric-based spares algorithms
• Machine-checked verification of the correctness and amortized complexity of an efficient union-find implementation
• Quasi-Linear-Time Algorithms by Generalisation of Union-Find in CHR
• Corrigendum to: V. V. Vasilchikov, “Parallel Algorithm for Solving the Graph Isomorphism Problem”, Modeling and analysis of information systems, vol. 27, no. 1, pp. 86–94, 2020. DOI: https://doi.org/10.18255/1818-1015-2020-1-86-94

Cited in

(1)

• Corrigendum to ``Improving the computational efficiency of metric-based spares algorithms

This page was built for publication: Corrigendum to ``A simple and efficient union-find-delete algorithm

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