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.
2012
2012
Multi-core Spanning Forest Algorithms using the Disjoint-set Data Structure
We present new multi-core algorithms for computing spanning forests and connected components of large sparse graphs. The… 
Highly Cited
2012
Highly Cited
2012
Minimum camera barrier coverage in wireless camera sensor networks
Barrier coverage is an important issue in wireless sensor network. In wireless camera sensor networks, the cameras take the… 
Highly Cited
2010
Highly Cited
2010
Experiments on Union-Find Algorithms for the Disjoint-Set Data Structure
The disjoint-set data structure is used to maintain a collection of non-overlapping sets of elements from a finite universe… 
Highly Cited
2007
Highly Cited
2007
Fast congruence closure and extensions
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… 
Highly Cited
2003
Highly Cited
2003
Packet classification for core routers: is there an alternative to CAMs?
A classifier consists of a set of rules for classifying packets based on header fields. Because core routers can have fairly… 
Highly Cited
1998
Highly Cited
1998
Marked ancestor problems
Consider a rooted tree whose nodes can be in two states: marked or unmarked. The marked ancestor problem is to maintain a data… 
Highly Cited
1997
Highly Cited
1997
A Fast Algorithm for Bottom-Up Document Layout Analysis
This paper describes a new bottom-up method for document layout analysis. The algorithm was implemented in the CLIDE (Chemical… 
Highly Cited
1995
Highly Cited
1995
Efficient implementation of suffix trees
We study the problem of string searching using the traditional approach of storing all unique substrings of the text in a suffix… 
Review
1991
Review
1991
Data structures and algorithms for disjoint set union problems
This paper surveys algorithmic techniques and data structures that have been proposed tosolve thesetunion problem and its… 
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)