## A Simple Parallel Algorithm for the Single-Source Shortest Path Problem on Planar Digraphs

- Jesper Larsson Träff, Christos D. Zaroliagis
- J. Parallel Distrib. Comput.
- 2000

@article{Srikrishna1995OptimalPA, title={Optimal Parallel Algorithms for Path Problems on Planar Graphs}, author={G. Srikrishna and C. Pandu Rangan}, journal={Theor. Comput. Sci.}, year={1995}, volume={145}, pages={27-43} }

- Published 1995 in Theor. Comput. Sci.
DOI:10.1016/0304-3975(94)00189-P

Given a biconnected planar graph G and a pair of vertices s and t, the two disjoint problem asks to find a pair of internally disjoint paths from s to t. We present a simple and efficient parallel algorithm for the same. Our algorithm uses the notion of bridges in a novel way and this results in a more elegant and simple algorithm than the existing one. The all-bidirectionaledges (ABE) problem is to find an edge labeling such that an edge (u, u) in E is labeled (u, u) or (v, u) or both… CONTINUE READING