Efficient parallel algorithms for shortest paths in planar digraphs
暂无分享,去创建一个
[1] Paul G. Spirakis,et al. Optimal Parallel Algorithms for Sparse Graphs , 1990, WG.
[2] Bonnie Berger,et al. Efficient NC Algorithms for Set Cover with Applications to Learning and Geometry , 1994, J. Comput. Syst. Sci..
[3] Michael L. Fredman,et al. New Bounds on the Complexity of the Shortest Path Problem , 1976, SIAM J. Comput..
[4] David G. Kirkpatrick,et al. A Simple Parallel Tree Contraction Algorithm , 1989, J. Algorithms.
[5] Richard Cole,et al. Approximate Parallel Scheduling. Part I: The Basic Technique with Applications to Optimal Parallel List Ranking in Logarithmic Time , 1988, SIAM J. Comput..
[6] Robert E. Tarjan,et al. Fibonacci heaps and their uses in improved network optimization algorithms , 1987, JACM.
[7] Clyde L. Monma,et al. On the Complexity of Covering Vertices by Faces in a Planar Graph , 1988, SIAM J. Comput..
[8] Richard M. Karp,et al. A Survey of Parallel Algorithms for Shared-Memory Machines , 1988 .
[9] Paul G. Spirakis,et al. Efficient Parallel Algorithms for Shortest Paths in Planar Graphs , 1990, SWAT.
[10] Greg N. Frederickson,et al. Planar graph decomposition and all pairs shortest paths , 1991, JACM.
[11] Greg N. Frederickson,et al. A new approach to all pairs shortest paths in planar graphs , 1987, STOC.
[12] Andrew V. Goldberg,et al. Parallel symmetry-breaking in sparse graphs , 1987, STOC.
[13] Sartaj Sahni,et al. Parallel Matrix and Graph Algorithms , 1981, SIAM J. Comput..
[14] Andrzej Lingas,et al. Efficient Parallel Algorithms for Path Problems in Planar Directed Graphs , 1990, SIGAL International Symposium on Algorithms.
[15] Edsger W. Dijkstra,et al. A note on two problems in connexion with graphs , 1959, Numerische Mathematik.
[16] Philip N. Klein,et al. An efficient parallel algorithm for planarity , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).
[17] Torben Hagerup. Optimal Parallel Algorithms on Planar Graphs , 1990, Inf. Comput..
[18] Richard B. Tan,et al. Computer Networks with Compact Routing Tables , 1986 .
[19] Gary L. Miller,et al. A parallel algorithm for finding a separator in planar graphs , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).
[20] Grammati E. Pantziou,et al. Computing Shortest Paths and Distances in Planar Graphs , 1991, ICALP.