Abstract
We present a preprocessing of planar digraphs which yields processor-efficient, poly-log time algorithms for the single-source and all-pairs shortest-path problems, breadth-first search and reachability in planar digraphs.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
A.V. Aho, J.E. Hopcroft and J.D. Ullman, The Design and Analysis of Computer Algorithms (Addison-Wesley, Reading, Massachusetts, 1974).
R. Cole, Parallel Merge Sort, Proc. 27th Ann. Symp. on Foundations of Computer Science.
D. Coppersmith, S. Winograd, Matrix Multiplication via Arithmetic Progressions, Proc. 28th Annual ACM Symp. on Theory of Computing, 1987, pp. 1–6.
H. Gazit, personnal communication, 1989.
H. Gazit and G.L. Miller, A Parallel Algorithm for Finding a Separator in Planar Graphs, Proc. 28th Symp. on Foundations of Computer Science, 1987.
R.M. Karp and V. Ramachandran, A Survey of Parallel Algorithms for Shared-Memory Machines, Technical Report UCB-CSD 88–408, Computer Science Division, EECS, University of California at Berkeley, 1988. To appear in the Handbook of Theoretical Computer Science, North-Holland.
M.Y. Kao, P.N. Klein, Towards overcoming the transitive-closure bottleneck: Efficient parallel algorithms for planar digraphs, to appear in Proc. 22nd Annual ACM Symp. on Theory of Computing, 1990.
P.N. Klein, J.H. Reif, An Efficient Parallel Algorithm for Planarity, Proc. 27th Symp. on Foundations on Computer Science, 1986.
M.Y. Kao, G. Shannon, Local Reorientation, Global Order, and Planar Topology, Proc. 21st Annual ACM Symp. on Theory of Computing, Seattle, 1989.
R.J. Lipton and R.E. Tarjan, A Separator Theorem for Planar Graphs, SIAM J. Appl. Math. 36 (1979), pp. 177–189.
K. Mehlhorn, Data Structures and Algorithms 2: Graph Algorithms and NP-Completeness Springer Verlag, 1984, pp. 155–158.
J. Reif, personnal communication, 1989.
F. Romani, Shortest-path problem is not harder than matrix multiplication, Information Processing Letters, 11(1980), pp. 134–136.
V.P. Pan and J. Reif, Extension of the Parallel Nested Dissection Algorithm to the Path Algebra Problems, Technical Report 85-9, Comput. Sci. Dept., SUNYA, Albany, NY, 1985.
V.P. Pan and J. Reif, Fast and Efficient Solution of Path Algebra Problems, JCSS 38 (1989), pp. 494–510.
Y. Shiloach and U. Vishkin, An O(log n) Parallel Connectivity Algorithm, J. Algorithms 3, 1, 57–67.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lingas, A. (1990). Efficient parallel algorithms for path problems in planar directed graphs. In: Asano, T., Ibaraki, T., Imai, H., Nishizeki, T. (eds) Algorithms. SIGAL 1990. Lecture Notes in Computer Science, vol 450. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-52921-7_94
Download citation
DOI: https://doi.org/10.1007/3-540-52921-7_94
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-52921-7
Online ISBN: 978-3-540-47177-6
eBook Packages: Springer Book Archive