Abstract
It has long been a fundamental open problem whether polylog time and {\em linear} processors are sufficient to find the strongly connected components of a directed graph and compute directed spanning trees for these components. This paper provides the first nontrivial partial solution to the tree problem: for a planar directed graph with $n$ vertices, if the graph is strongly connected, then a directed spanning tree rooted at a specified vertex can be built in $0(log^2~n)$ time using $0(n)$ processors. The algorithm is deterministic and runs on a parallel random access machine that allows concurrent reads and concurrent writes in its shared memory. The result complements an algorithm by Kao that computes the strongly connected components of a planar directed graph in $0(log^3~n)$ time and $0(n)$ processors.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.