Tree Contraction
Tree Contraction is a parallel algorithmic technique in computational graph theory that repeatedly reduces the size of a tree by merging nodes and edges through a sequence of local operations, specifically aiming to simplify the tree structure while preserving essential connectivity and enabling efficient evaluation of tree-based computations.
47
Publications
2.3K
Citations
99
Authors
55
Institutions
Publications per year
2017–2026
3
Parents
47
Parallel tree contraction and its application
Gary L. Miller, John H. Reif · 1985 · 411 citations
A simple parallel tree contraction algorithm
Karl Abrahamson, Norm Dadoun, David Kirkpatrick et al. · Journal of Algorithms · 1989 · 246 citations
The contraction method for recursive algorithms
U. Rösler, Ludger Rüschendorf · Algorithmica · 2001 · 179 citations
Parallel Tree Contraction Part 2: Further Applications
Gary L. Miller, John H. Reif · SIAM Journal on Computing · 1991 · 104 citations
1–5 of 47
99
5
h-index
3
h-index
3
h-index
3
h-index
3
h-index
1–5 of 99
55
University of California San Diego
San Diego, United States
4 h-index
6 publications
300 citations
Carnegie Mellon University
Pittsburgh, United States
4 h-index
18 publications
858 citations
University of Bergen
Bergen, Norway
3 h-index
5 publications
222 citations
Laboratoire d'Informatique, de Robotique et de Microélectronique de Montpellier
Montpellier, France
2 h-index
4 publications
140 citations

Université de Montpellier
Montpellier, France
2 h-index
4 publications
140 citations

Stevens Institute of Technology
Hoboken, United States
2 h-index
3 publications
95 citations
Princeton University
Princeton, United States
2 h-index
4 publications
124 citations

University of British Columbia
Vancouver, Canada
2 h-index
5 publications
780 citations
1–8 of 55
3 publications · 237 citations
3
h-index
2 publications · 258 citations
2
h-index
2 publications · 55 citations
2
h-index
Repository · 2 publications · 109 citations
2
h-index
2 publications · 120 citations
2
h-index
1–5