Chong, Han and Lam showed that undirected st-connectivity can be solved on the EREW PRAM in $O({\log}n)$ time with $O(m+n)$ processors. What is the best known parallel algorithm for st-connectivity in directed planar graphs ?Please state the running time, deterministic/randomized algorithm and the PRAM model used (assuming the number of processors is polynomial).This question is related to one of my previous questions. My previous question is about general directed graphs which are not necessarily planar.
Parallel algorithms for reachability in directed planar graphs
ds.algorithms;graph theory;dc.parallel comp