Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Related topics

Related topics

31 relations
Ackermann functionAmortized analysisBiconnected componentBinomial heap
Expand

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2012
Highly Cited
2012
A new scalable parallel DBSCAN algorithm using the disjoint-set data structure
DBSCAN is a well-known density based clustering algorithm capable of discovering arbitrary shaped clusters and eliminating noise… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
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… Expand
  • table I
  • table II
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
2010
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… Expand
  • table 1
  • table 2
  • table 3
  • table 4
  • figure 1
Is this relevant?
Highly Cited
2004
Highly Cited
2004
Deterministic memory-efficient string matching algorithms for intrusion detection
Intrusion detection systems (IDSs) have become widely recognized as powerful tools for identifying, deterring and deflecting… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 7
Is this relevant?
Highly Cited
2000
Highly Cited
2000
CLOSET: An Efficient Algorithm for Mining Frequent Closed Itemsets
Association mining may often derive an undesirably large set of frequent itemsets and association rules. Recent studies have… Expand
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • table 2
Is this relevant?
Highly Cited
1999
Highly Cited
1999
IP-address lookup using LC-tries
There has been a notable interest in the organization of routing information to enable fast lookup of IP addresses. The interest… Expand
  • figure 1
  • table I
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
1989
Highly Cited
1989
The cell probe complexity of dynamic data structures
Dynamic data structure problems involve the representation of data in memory in such a way as to permit certain types of… Expand
Is this relevant?
Highly Cited
1985
Highly Cited
1985
A Linear-Time Algorithm for a Special Case of Disjoint Set Union
This paper presents a linear-time algorithm for the special case of the disjoint set union problem in which the structure of the… Expand
Is this relevant?
Highly Cited
1984
Highly Cited
1984
Worst-case Analysis of Set Union Algorithms
This paper analyzes the asymptotic worst-case running time of a number of variants of the well-known method of path compression… Expand
  • figure 2
  • figure 3
  • figure 6
  • figure 7
  • figure 8
Is this relevant?
Highly Cited
1983
Highly Cited
1983
A linear-time algorithm for a special case of disjoint set union
This paper presents a linear-time algorithm for the special case of the disjoint set union problem in which the structure of the… Expand
Is this relevant?
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE