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)

Semantic Scholar uses AI to extract papers important to this topic.

2013

2013

- Wojciech Fraczak, Loukas Georgiadis, Andrew Miller, Robert E. Tarjan
- J. Discrete Algorithms
- 2013

The problem of finding dominators in a directed graph has many important applications, notably in global optimization of computer… (More)

Is this relevant?

2012

2012

- Md. Mostofa Ali Patwary, Diana Palsetia, Ankit Agrawal, Wei-keng Liao, Fredrik Manne, Alok N. Choudhary
- 2012 International Conference for High…
- 2012

DBSCAN is a well-known density based clustering algorithm capable of discovering arbitrary shaped clusters and eliminating noise… (More)

Is this relevant?

2012

2012

- Md. Mostofa Ali Patwary, Peder Refsnes, Fredrik Manne
- 2012 IEEE 26th International Parallel and…
- 2012

We present new multi-core algorithms for computing spanning forests and connected components of large sparse graphs. The… (More)

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)

Is this relevant?

Highly Cited

2004

Highly Cited

2004

- Mikael Millberg, Erland Nilsson, Rikard Thid, Axel Jantsch
- Proceedings Design, Automation and Test in Europe…
- 2004

In today's emerging Network-on-Chips, there is a need for different traffic classes with different Quality-of-Service guarantees… (More)

Is this relevant?

Highly Cited

2000

Highly Cited

2000

- Jian Pei, Jiawei Han, Runying Mao
- ACM SIGMOD Workshop on Research Issues in Data…
- 2000

Association mining may often derive an undesirably large set of frequent itemsets and association rules. Recent studies have… (More)

Is this relevant?

Review

1991

Review

1991

- Zvi Galil, Giuseppe F. Italiano
- ACM Comput. Surv.
- 1991

This paper surveys algorithmic techniques and data structures that have been proposed to solve the set union problem and its… (More)

Is this relevant?

Highly Cited

1989

Highly Cited

1989

- Michael L. Fredman, Michael E. Saks
- STOC
- 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

- Norbert Blum
- SIAM J. Comput.
- 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

- Robert E. Tarjan, Jan van Leeuwen
- J. ACM
- 1984

This paper analyzes the asymptotic worst-case running time of a number of variants of the well-known method of path compression… (More)

Is this relevant?