A new data structure for the UNION-FIND problem

DOI10.1016/0020-0190(79)90106-6zbMath0404.68052OpenAlexW2077157798MaRDI QIDQ1256854

Marek J. Lao

Publication date: 1979

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(79)90106-6

zbMATH Keywords

TreePartitionEquivalenceComputational ComplexityData StructuresSet Union

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05)

Cites Work

• Unnamed Item
• The expected linearity of a simple equivalence algorithm
• An algorithm for equivalence declarations
• Efficiency of a Good But Not Linear Set Union Algorithm
• Efficiency of Equivalence Algorithms
• Set Merging Algorithms

This page was built for publication: A new data structure for the UNION-FIND problem