A simple and efficient union-find-delete algorithm

DOI10.1016/j.tcs.2010.11.005zbMath1209.68150OpenAlexW2009802499MaRDI QIDQ620968

Simon Yoffe, Amir M. Ben-Amram

Publication date: 2 February 2011

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

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

zbMATH Keywords

data structuresunion-finddisjoint sets

Mathematics Subject Classification ID

Data structures (68P05)

Related Items

The longest common substring problem

Cites Work

• Unnamed Item
• Worst-case Analysis of Set Union Algorithms
• Efficiency of a Good But Not Linear Set Union Algorithm
• Automata, Languages and Programming