Disjoint Set Data Structures

Disjoint Set Data Structures is a data structure that partitions a set of elements into disjoint, non-overlapping subsets and supports operations for efficiently determining which subset an element belongs to and merging subsets.

58

Publications

2.8K

Citations

119

Authors

73

Institutions

Publications per year

2017–2026

5

Authors

119

  1. RE
    Robert E. Tarjan

    Princeton University, United States

    6 publications · 410 citations

    6

    h-index

  2. ZW
    Zhusheng Wang

    University of Maryland, College Park, United States

    3 publications · 92 citations

    3

    h-index

  3. ŞU
    Şennur Ulukuş

    University of Maryland, College Park, United States

    3 publications · 92 citations

    3

    h-index

  4. KB
    Karim Banawan

    University of Maryland, College Park, United States

    3 publications · 92 citations

    3

    h-index

  5. HK
    Haim Kaplan

    Tel Aviv University, Israel

    3 publications · 111 citations

    3

    h-index

1–5 of 119

Venues

  1. IEEE Transactions on Information Theory

    5 publications · 225 citations

    5

    h-index

  2. SIAM Journal on Computing

    3 publications · 171 citations

    3

    h-index

  3. Discrete Mathematics

    3 publications · 69 citations

    3

    h-index

  4. Discrete Applied Mathematics

    2 publications · 52 citations

    2

    h-index

  5. Proceedings of the VLDB Endowment

    PVLDB · 2 publications · 173 citations

    2

    h-index

1–5