110 search results - page 1 / 22 » A persistent union-find data structure |
WEA
2010
Springer
13 years 11 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
13 years 10 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 ...
ML
2007
ACM
13 years 4 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...
SODA
2001
ACM
13 years 6 months ago
2001
ACM
We address a longstanding open problem of [11, 10], and present a general transformation that transforms any pointer based data structure to be confluently persistent. Such transf...
GCC
2007
Springer
13 years 11 months ago
2007
Springer
Data service is the principle application in structured P2P networks. And in many cases, we need the data to persist for a long time. So how to persist the data service and how lo...