Union-find Data Structures
Union-Find Data Structures is a dynamic data structure that maintains a collection of disjoint sets under the operations of union, which merges two sets, and find, which determines the set representative of a given element, enabling efficient connectivity queries and incremental clustering in near-constant amortized time.
50
Publications
2.8K
Citations
107
Authors
69
Institutions
Publications per year
2017–2026
6
Variants
Disjoint-set Data Structure
50
Table union search on open data
Fatemeh Nargesian, Erkang Zhu, Ken Q. Pu et al. · Proceedings of the VLDB Endowment · 2018 · 193 citations
1–5 of 50
107
Hong Kong University of Science and Technology, Hong Kong SAR China
2 publications · 55 citations
2
h-index
2
h-index
2
h-index
2
h-index
2
h-index
1–5 of 107
69

Centre National de la Recherche Scientifique
Paris, France
4 h-index
7 publications
458 citations

Tel Aviv University
Tel Aviv, Israel
4 h-index
7 publications
168 citations
Utrecht University
Utrecht, The Netherlands
4 h-index
5 publications
134 citations
Université Paris-Sud
Orsay, France
3 h-index
6 publications
227 citations

University of Toronto
Toronto, Canada
2 h-index
4 publications
615 citations

TU Wien
Vienna, Austria
2 h-index
2 publications
44 citations

University of Twente
Enschede, The Netherlands
2 h-index
4 publications
88 citations
University of Washington
Seattle, United States
2 h-index
3 publications
174 citations
1–8 of 69
ENTCS · 3 publications · 70 citations
3
h-index
TALG · 2 publications · 32 citations
2
h-index
2 publications · 27 citations
2
h-index
1 publications · 11 citations
1
h-index
1 publications · 357 citations
1
h-index
1–5