Parallel Tree Decomposition

Parallel Tree Decomposition is a computational framework that partitions a tree-structured problem into concurrently solvable subproblems to enable efficient parallel processing while preserving the hierarchical dependencies inherent in the original structure.

72

Publications

4.4K

Citations

170

Authors

93

Institutions

Publications per year

2017–2026

8

Authors

170

  1. GE
    Guy E. Blelloch

    Carnegie Mellon University, United States

    3 publications · 121 citations

    3

    h-index

  2. JS
    Julian Shun

    Carnegie Mellon University, United States

    3 publications · 92 citations

    3

    h-index

  3. JL
    Julian Labeit

    Karlsruhe Institute of Technology, Germany

    2 publications · 79 citations

    2

    h-index

  4. PG
    P. Gibbon

    Forschungszentrum Jülich, Germany

    2 publications · 39 citations

    2

    h-index

  5. NS
    Neal Sample

    Stanford University, United States

    2 publications · 36 citations

    2

    h-index

1–5 of 170

Venues

  1. Parallel Computing

    3 publications · 67 citations

    3

    h-index

  2. Journal of Computational Science

    2 publications · 51 citations

    2

    h-index

  3. Algorithmica

    2 publications · 127 citations

    2

    h-index

  4. 2

    h-index

  5. IEEE Transactions on Computers

    2 publications · 84 citations

    2

    h-index

1–5