Path Compression

Path Compression is an optimization technique in the Disjoint Set Union data structure that, during a find operation, reconfigures the parent pointers of nodes along the search path to point directly to the root, thereby flattening the structure to improve future query efficiency.

33

Publications

1.7K

Citations

80

Authors

41

Institutions

Publications per year

2017–2026

5

Authors

80

  1. RE
    Robert E. Tarjan

    Princeton University, United States

    4 publications · 406 citations

    4

    h-index

  2. AL
    Adam L. Buchsbaum

    AT&T (United States), United States

    3 publications · 158 citations

    3

    h-index

  3. AB
    Adi Botea

    IBM Research - Ireland, Ireland

    3 publications · 49 citations

    3

    h-index

  4. JW
    Jeffery Westbrook

    AT&T (United States), United States

    2 publications · 141 citations

    2

    h-index

  5. HV
    H. V. Jagadish

    AT&T (United States), United States

    2 publications · 191 citations

    2

    h-index

1–5 of 80

Venues

  1. SIAM Journal on Computing

    4 publications · 145 citations

    4

    h-index

  2. ACM Transactions on Database Systems

    TODS · 2 publications · 234 citations

    2

    h-index

  3. 1

    h-index

  4. 1

    h-index

  5. 1

    h-index

1–5