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…

Papers overview

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

2020

Feature tracking and the visualizations of the resulting trajectories make it possible to derive insights from scientific data…

2020

This paper studies a planning problem for supplying hot water in domestic environment. Hereby, boilers (e.g. gas or electric…

2014

In this lecture, we will cover amortized analysis, which is a method where we consider the average work done over an entire…

2009

Blob detection is an essential ingredient process in some computer applications such as intelligent visual surveillance. However…

2007

We describe an implementation of the Maximally Stable Extremal Region ([3], Sect. 2, MSER) feature detector and an immediate…

2006

ILP (instruction level parallelism) processors are being increasingly used in embedded systems. In embedded systems, instructions…

2004

Ad-hoc on-demand routing protocols like AODV establish and maintain routes on-demand. However, the paths established by on-demand…

1999

nodes in group g is at most n F (g) (F (g) − F (g − 1)) ≤ n. Since there are at most log * n groups (0, 1,. .. , log * n−1), it…

1998

Given a box of AND gates, each of fan-in 2, it is known that k OR gates are mistakenly put into a box of AND gates. Suppose that…

1991

We consider the problem of maintaining a partition of n elements of disjoint sets under an arbitrary sequence of union and find…