Parallel Planar Graph Algorithms

Parallel Planar Graph Algorithms is a computational framework within parallel algorithm design that specifically addresses the efficient processing of planar graph problems by exploiting both the structural properties of planarity and the concurrency of multiple processing units to achieve improved time complexity.

25

Publications

1K

Citations

38

Authors

24

Institutions

Publications per year

2017–2026

0

Authors

38

  1. JH
    John H. Reif

    Duke University, United States

    4 publications · 168 citations

    4

    h-index

  2. PN
    Philip N. Klein

    Brown University, United States

    4 publications · 156 citations

    4

    h-index

  3. HG
    Hillel Gazit

    University of Southern California, United States

    3 publications · 83 citations

    3

    h-index

  4. AV
    Andrew V. Goldberg

    Stanford University, United States

    3 publications · 373 citations

    3

    h-index

  5. SP
    Serge Plotkin

    Stanford University, United States

    3 publications · 373 citations

    3

    h-index

1–5 of 38

Venues

  1. SIAM Journal on Computing

    4 publications · 157 citations

    4

    h-index

  2. Journal of Computer and System Sciences

    2 publications · 95 citations

    2

    h-index

  3. Journal of Parallel and Distributed Computing

    2 publications · 43 citations

    2

    h-index

  4. Discrete Applied Mathematics

    1 publications · 11 citations

    1

    h-index

  5. BIT Numerical Mathematics

    1 publications · 11 citations

    1

    h-index

1–5