804 search results - page 1 / 161 » Experiments on Union-Find Algorithms for the Disjoint-Set Da... |
194
click to vote
WEA
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. The disjoint-set data structure is used to maintain a collection of non-overlapping sets of elements from a finite universe. Algorithms that operate on this data structu...
ICALP
2005
Springer
15 years 6 months ago
2005
Springer
A union-find data structure maintains a collection of disjoint sets under makeset, union and find operations. Kaplan, Shafrir and Tarjan [SODA 2002] designed data structures for ...
88
Voted
ML
2007
ACM
14 years 12 months ago
2007
ACM
The problem of disjoint sets, also known as union-find, consists in maintaining a partition of a finite set within a data structure. This structure provides two operations: a fu...
IPPS
1996
IEEE
15 years 4 months ago
1996
IEEE
In this paper, we study on the EREW-PRAM model a parallel solution to the extended set union problem with unlimited backtracking which maintains a dynamic partition of an n-elemen...
101
Voted
MVA
2007
14 years 12 months ago
2007
The application of a technique for labelling connected components based on the classical recursive technique is studied. The recursive approach permits labelling, counting, and cha...