Efficient parallel shortest-paths in digraphs with a separator decomposition

Efficient parallel shortest-paths in digraphs with a separator decomposition

[1]  Greg N. Frederickson,et al.  Fast Algorithms for Shortest Paths in Planar Graphs, with Applications , 1987, SIAM J. Comput..

[2]  Don Coppersmith,et al.  Matrix multiplication via arithmetic progressions , 1987, STOC.

[3]  Victor Y. Pan,et al.  Fast and Efficient Solution of Path Algebra Problems , 1989, J. Comput. Syst. Sci..

[4]  Gary L. Miller,et al.  A unified geometric approach to graph separators , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[5]  Greg N. Frederickson,et al.  Planar graph decomposition and all pairs shortest paths , 1991, JACM.

[6]  Grammati E. Pantziou,et al.  Computing Shortest Paths and Distances in Planar Graphs , 1991, ICALP.

[7]  Ming-Yang Kao,et al.  Towards overcoming the transitive-closure bottleneck: efficient parallel algorithms for planar digraphs , 1990, STOC '90.

[8]  Victor Y. Pan,et al.  The Parallel Computation of Minimum Cost Paths in Graphs by Stream Contraction , 1991, Inf. Process. Lett..

[9]  Yijie Han,et al.  Efficient parallel algorithms for computing all pair shortest paths in directed graphs , 1992, SPAA '92.

[10]  R. Tarjan,et al.  A Separator Theorem for Planar Graphs , 1977 .

[11]  Paul G. Spirakis,et al.  Efficient parallel algorithms for shortest paths in planar digraphs , 1992, BIT Comput. Sci. Sect..

[12]  Ming-Yang Kao,et al.  Local reorientation, global order, and planar topology , 1989, STOC '89.

[13]  Philip N. Klein,et al.  A Fully Dynamic Approximation Scheme for All-Pairs Shortest Paths in Planar Graphs , 1993, WADS.

[14]  Andrzej Lingas,et al.  Efficient Parallel Algorithms for Path Problems in Planar Directed Graphs , 1990, SIGAL International Symposium on Algorithms.