Optimal Parallel Algorithms for Path Problems on Planar Graphs

@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}
}
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

From This Paper

Topics from this paper.
1 Citations
20 References
Similar Papers

Similar Papers

Loading similar papers…