Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 238,226,774 papers from all fields of science
Search
Sign In
Create Free Account
Disjoint-set data structure
Known as:
Merge-Find-set
, Union-find data structure
, Union-find algorithm
Expand
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
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
31 relations
Ackermann function
Amortized analysis
Biconnected component
Binomial heap
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2020
2020
Distributed Asynchronous Union-Find for Scalable Feature Tracking
Jiayi Xu
,
Hanqi Guo
,
+5 authors
T. Peterka
arXiv.org
2020
Corpus ID: 212414924
Feature tracking and the visualizations of the resulting trajectories make it possible to derive insights from scientific data…
Expand
2017
2017
University of Groningen Fast computation of morphological area pattern spectra
Arnold Meijster
,
M. Wilkinson
2017
Corpus ID: 19940110
An area based counterpart of the binary structural opening spectra is developed. It is shown that these area opening and closing…
Expand
2015
2015
Weighted graph algorithms with Python
A. Kapanowski
,
L. Galuszka
arXiv.org
2015
Corpus ID: 29598991
Python implementation of selected weighted graph algorithms is presented. The minimal graph interface is defined together with…
Expand
2010
2010
Scalable rekeying for dynamic groups using key path compression
D. Raju
,
Valli Kumari Vatsavayi
,
K. S. Raju
International Conference on Communication Systems…
2010
Corpus ID: 36886652
This paper proposes a technique for dynamic group key rekeying which is based on path compression of the key path of the new…
Expand
2007
2007
An Implementation of Multi-Dimensional Maximally Stable Extremal Regions
A. Vedaldi
2007
Corpus ID: 13061842
We describe an implementation of the Maximally Stable Extremal Region ([3], Sect. 2, MSER) feature detector and an immediate…
Expand
2006
2006
Instruction Scheduling with Release Times and Deadlines on ILP Processors
Hui Wu
,
J. Jaffar
,
Jingling Xue
IEEE International Conference on Embedded and…
2006
Corpus ID: 8343325
ILP (instruction level parallelism) processors are being increasingly used in embedded systems. In embedded systems, instructions…
Expand
2004
2004
A path compression technique for on-demand ad-hoc routing protocols
V. C. Giruka
,
M. Singhal
,
Siva Prasad Yarravarapu
IEEE International Conference on Mobile Ad-hoc…
2004
Corpus ID: 9652464
Ad-hoc on-demand routing protocols like AODV establish and maintain routes on-demand. However, the paths established by on-demand…
Expand
1999
1999
Heaps and the Disjoint Sets Data Structures
M. H. Alsuwaiyel
Algorithms
1999
Corpus ID: 124961582
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…
Expand
1998
1998
Optimal Boolean Circuits with Unreliable Gates (extended Abstract)
Keh-Ning Chang
,
Shi-Chun Tsaiy
1998
Corpus ID: 15192540
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…
Expand
1991
1991
Fully Persistent Data Structures for Disjoint Set Union Problems
G. Italiano
,
Neil Sarnak
Workshop on Algorithms and Data Structures
1991
Corpus ID: 10445962
We consider the problem of maintaining a partition of n elements of disjoint sets under an arbitrary sequence of union and find…
Expand