Parallel Geometric Graph Algorithms

Parallel Geometric Graph Algorithms is a class of parallel algorithms designed to solve computational problems involving graphs embedded in geometric space, where the computation exploits both the structural properties of graphs and the spatial relationships among geometrically represented vertices or edges through concurrent processing.

25

Publications

848

Citations

52

Authors

34

Institutions

Publications per year

2017–2026

5

Authors

52

  1. MJ
    Mikhail J. Atallah

    Purdue University West Lafayette, United States

    3 publications · 131 citations

    3

    h-index

  2. JS
    Jörg-Rüdiger Sack

    Carleton University, Canada

    2 publications · 40 citations

    2

    h-index

  3. MT
    Michael T. Goodrich

    Johns Hopkins University, United States

    2 publications · 121 citations

    2

    h-index

  4. JC
    Julien Constantin

    Université de Sherbrooke, Canada

    1 publications · 38 citations

    1

    h-index

  5. GL
    Gary L. Miller

    Carnegie Mellon University, United States

    1 publications · 67 citations

    1

    h-index

1–5 of 52

Venues

  1. Algorithmica

    7 publications · 154 citations

    7

    h-index

  2. Proceedings of the International Conference on Parallel Processing

    Conference · 2 publications · 40 citations

    2

    h-index

  3. Annals of Combinatorics

    AC · 1 publications · 29 citations

    1

    h-index

  4. Computers in Industry

    1 publications · 12 citations

    1

    h-index

  5. ACM SIGOPS Operating Systems Review

    1 publications · 15 citations

    1

    h-index

1–5