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

Authors

99

  1. GE
    Guy E. Blelloch

    Carnegie Mellon University, United States

    5 publications · 216 citations

    5

    h-index

  2. GL
    Gary L. Miller

    Carnegie Mellon University, United States

    3 publications · 583 citations

    3

    h-index

  3. JS
    Julian Shun

    Carnegie Mellon University, United States

    3 publications · 107 citations

    3

    h-index

  4. JH
    John H. Reif

    Duke University, United States

    3 publications · 583 citations

    3

    h-index

  5. LR
    Ludger Rüschendorf

    University of Freiburg, Germany

    3 publications · 216 citations

    3

    h-index

1–5 of 99

Venues

  1. Algorithmica

    3 publications · 237 citations

    3

    h-index

  2. Journal of Algorithms

    2 publications · 258 citations

    2

    h-index

  3. Discrete Applied Mathematics

    2 publications · 55 citations

    2

    h-index

  4. 2

    h-index

  5. Journal of Combinatorial Theory Series B

    2 publications · 120 citations

    2

    h-index

1–5