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
33
Applications of Path Compression on Balanced Trees
Robert E. Tarjan · Journal of the ACM · 1979 · 300 citations · Full text
1–5 of 33
80
4
h-index
3
h-index
3
h-index
2
h-index
2
h-index
1–5 of 80
41
IBM Research - Ireland
Dublin, Ireland
3 h-index
3 publications
49 citations
Stanford University
Stanford, United States
3 h-index
3 publications
326 citations
AT&T (United States)
Bedminster, United States
3 h-index
7 publications
459 citations
University of Southern California
Los Angeles, United States
2 h-index
6 publications
76 citations

Data61
Sydney, Australia
2 h-index
2 publications
36 citations

Tel Aviv University
Tel Aviv, Israel
1 h-index
2 publications
56 citations
Indian Institute of Engineering Science and Technology, Shibpur
Howrah, India
1 h-index
2 publications
24 citations

Ewha Womans University
Seoul, South Korea
1 h-index
2 publications
20 citations
1–8 of 41
4 publications · 145 citations
4
h-index
TODS · 2 publications · 234 citations
2
h-index
1 publications · 44 citations
1
h-index
1 publications · 20 citations
1
h-index
1 publications · 14 citations
1
h-index
1–5