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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1976-2017
010203019762017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
The problem of finding dominators in a directed graph has many important applications, notably in global optimization of computer… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2012
2012
DBSCAN is a well-known density based clustering algorithm capable of discovering arbitrary shaped clusters and eliminating noise… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2012
2012
We present new multi-core algorithms for computing spanning forests and connected components of large sparse graphs. The… (More)
  • table I
  • table II
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
2010
2010
The disjoint-set data structure is used to maintain a collection of non-overlapping sets of elements from a finite universe… (More)
  • table 1
  • table 2
  • table 3
  • table 4
  • figure 1
Is this relevant?
Highly Cited
2004
Highly Cited
2004
In today's emerging Network-on-Chips, there is a need for different traffic classes with different Quality-of-Service guarantees… (More)
  • figure 1
  • figure 2
  • figure 4
  • figure 3
  • figure 7
Is this relevant?
Highly Cited
2000
Highly Cited
2000
Association mining may often derive an undesirably large set of frequent itemsets and association rules. Recent studies have… (More)
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • table 2
Is this relevant?
Review
1991
Review
1991
This paper surveys algorithmic techniques and data structures that have been proposed to solve the set union problem and its… (More)
  • figure 5.1
  • figure 5.2
  • figure 5.3
Is this relevant?
Highly Cited
1989
Highly Cited
1989
Dynamic data structure problems involve the representation of data in memory in such a way as to permit certain types of… (More)
Is this relevant?
1986
1986
We give an algorithm for the disjoint set union problem, within the class of algorithms defined by Tarjan, which has O(log n/log… (More)
Is this relevant?
Highly Cited
1984
Highly Cited
1984
This paper analyzes the asymptotic worst-case running time of a number of variants of the well-known method of path compression… (More)
  • figure 2
  • figure 3
  • figure 6
  • figure 7
  • figure 8
Is this relevant?