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.

2017

Given a graph G and a vertex q∈G\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts…

2017

An area based counterpart of the binary structural opening spectra is developed. It is shown that these area opening and closing…

2012

We are proposing a hybrid algorithm for constructing an efficient Aho-Corasick automaton designed for data-parallel processing in…

2009

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

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…

1992

An algorithm for computing a minimal invariant partition of a permutation group due to Atkinson is analysed. The analysis shows…

1991

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

1990

Any instance of the disjoint set union problem of size n, using any union strategy, that does one find per node in postorder has…