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
Parents
25
Parallel symmetry-breaking in sparse graphs
Andrew V. Goldberg, Serge Plotkin, Gregory E. Shannon · 1987 · 156 citations
A parallel algorithm for finding a separator in planar graphs
Hillel Gazit, Gary L. Miller · 1987 · 52 citations
1–5 of 25
38
4
h-index
4
h-index
3
h-index
3
h-index
3
h-index
1–5 of 38
24
Duke University
Durham, United States
6 h-index
7 publications
215 citations
Brown University
Providence, United States
4 h-index
6 publications
166 citations

Saarland University
Saarbrücken, Germany
2 h-index
2 publications
55 citations
Case Western Reserve University
Cleveland, United States
1 h-index
3 publications
39 citations
Hebrew University of Jerusalem
Jerusalem, Israel
1 h-index
1 publications
16 citations
Courant Institute of Mathematical Sciences
New York, United States
1 h-index
1 publications
11 citations
University at Buffalo, State University of New York
Buffalo, United States
1 h-index
1 publications
11 citations

University of Warsaw
Warsaw, Poland
1 h-index
2 publications
52 citations
1–8 of 24
4 publications · 157 citations
4
h-index
2 publications · 95 citations
2
h-index
2 publications · 43 citations
2
h-index
1 publications · 11 citations
1
h-index
1 publications · 11 citations
1
h-index
1–5