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.
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… 
2012
2012
Tresorium: Cryptographic File System for Dynamic Groups over Untrusted Cloud Storage
In this paper, we present Tresorium, a cryptographic file system designed for cloud based data storage. In Tresorium, files are… 
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… 
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… 
2003
2003
Tests and diagnostics for heterogeneity in the species problem
Review
2000
Review
2000
Efficiently computing and updating triangle strips for real-time rendering
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… 
1991
1991
Fully Persistent Data Structures for Disjoint Set Union Problems
We consider the problem of maintaining a partition of n elements of disjoint sets under an arbitrary sequence of union and find… 
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)