Concepedia

Disjoint Set Forests

Disjoint Set Forests is a data structure that organizes disjoint sets into a collection of trees with path compression and union by rank optimizations to efficiently support union and find operations.

2

Publications

100

Citations

3

Authors

2

Institutions

Publications per year

2017–2026

0

Variants

Disjoint-set Forests

Parents

Publications

2

1–2 of 2

Authors

3

  1. EM
    Erik Murphy-Chutorian

    University of California San Diego, United States

    1 publications · 23 citations

    1

    h-index

  2. AE
    Ahmet Erdem Sarıyüce

    The Ohio State University, United States

    1 publications · 77 citations

    1

    h-index

  3. MM
    Mohan M. Trivedi

    University of California San Diego, United States

    1 publications · 23 citations

    1

    h-index

1–3 of 3

Institutions

2

  1. Sandia National Laboratories

    Albuquerque, United States

    1 h-index

    1 publications

    77 citations

  2. University of California San Diego

    San Diego, United States

    1 h-index

    2 publications

    46 citations

1–2 of 2

Venues

  1. Proceedings of the VLDB Endowment

    PVLDB · 1 publications · 77 citations

    1

    h-index

1–1