Skip to search formSkip to main contentSkip to account menu

Disjoint-set data structure

Known as: Merge-Find-set, Union-find data structure, Union-find algorithm 
In computer science, a disjoint-set data structure, also called a union–find data structure or merge–find set, is a data structure that keeps track… 
Wikipedia (opens in a new tab)

Related topics

Related topics

31 relations
Ackermann functionAmortized analysisBiconnected componentBinomial heap

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
A new name prefix trie with path compression
As one of promising future Internet architectures, named data networking (NDN) technology has been widely researched in these… 
2015
2015
A Path-Compression Approach for Improving Shortest-Path Algorithms
Given a weighted directed graph G=(V;E;w), where w is non-negative weight function, G’ is a graph obtained from G by an… 
2011
2011
Memory-Efficient IPv4/v6 Lookup on FPGAs Using Distance-Bounded Path Compression
Memory efficiency with compact data structures for Internet Protocol (IP) lookup has recently regained much interest in the… 
2005
2005
The Algebra of Equality Proofs
Proofs of equalities may be built from assumptions using proof rules for reflexivity, symmetry, and transitivity. Reflexivity is… 
2004
2004
A path compression technique for on-demand ad-hoc routing protocols
Ad-hoc on-demand routing protocols like AODV establish and maintain routes on-demand. However, the paths established by on-demand… 
2003
2003
Disjoint set data structure for morphological area operators
Morphological openings and closings are basic operators in mathematical morphology. Morphological area openings and area closings… 
Review
2000
Review
2000
Efficiently computing and updating triangle strips for real-time rendering
1999
1999
Worst-case and amortised optimality in union-find (extended abstract)
We study the interplay between worst-case and amortised time bounds for the classic Disjoint Set Union problem (Union-Find). We… 
1996
1996
A Comparison of Fast and Low Overhead Distributed Priority Locks
Distributed synchronization is necessary to coordinate the diverse activities of a distributed system. Priority synchronization… 
1990
1990
Postorder Disjoint Set Union is Linear
  • Joan M. Lucas
  • SIAM journal on computing (Print)
  • 1990
  • Corpus ID: 31094290
Any instance of the disjoint set union problem of size n, using any union strategy, that does one find per node in postorder has… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)