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

Authors

107

  1. KY
    Ke Yi

    Hong Kong University of Science and Technology, Hong Kong SAR China

    2 publications · 55 citations

    2

    h-index

  2. JA
    J. A. La Poutré

    Centrum Wiskunde & Informatica, Netherlands

    2 publications · 50 citations

    2

    h-index

  3. LN
    Laurent Najman

    Laboratoire d'Informatique Gaspard-Monge, France

    2 publications · 257 citations

    2

    h-index

  4. LA
    Lars Arge

    Aarhus University, Denmark

    2 publications · 55 citations

    2

    h-index

  5. MT
    Mikkel Thorup

    AT&T (United States), United States

    2 publications · 32 citations

    2

    h-index

1–5 of 107

Venues

  1. Electronic Notes in Theoretical Computer Science

    ENTCS · 3 publications · 70 citations

    3

    h-index

  2. ACM Transactions on Algorithms

    TALG · 2 publications · 32 citations

    2

    h-index

  3. SIAM Journal on Computing

    2 publications · 27 citations

    2

    h-index

  4. 1

    h-index

  5. Journal of Computational Biology

    1 publications · 357 citations

    1

    h-index

1–5