Computing Shortest Paths and Distances in Planar Graphs
暂无分享,去创建一个
Grammati E. Pantziou | Christos D. Zaroliagis | Hristo Djidjev | H. Djidjev | C. Zaroliagis | G. Pantziou
[1] Robert E. Tarjan,et al. Fibonacci heaps and their uses in improved network optimization algorithms , 1987, JACM.
[2] Andrzej Lingas,et al. Efficient Parallel Algorithms for Path Problems in Planar Directed Graphs , 1990, SIGAL International Symposium on Algorithms.
[3] Uzi Vishkin,et al. On Finding Lowest Common Ancestors: Simplification and Parallelization , 1988, AWOC.
[4] Greg N. Frederickson,et al. A new approach to all pairs shortest paths in planar graphs , 1987, STOC.
[5] Greg N. Frederickson,et al. Planar graph decomposition and all pairs shortest paths , 1991, JACM.
[6] Clyde L. Monma,et al. On the Complexity of Covering Vertices by Faces in a Planar Graph , 1988, SIAM J. Comput..
[7] Richard M. Karp,et al. The complexity of parallel computation , 1986 .
[8] Paul G. Spirakis,et al. Efficient Parallel Algorithms for Shortest Paths in Planar Graphs , 1990, SWAT.
[9] Richard B. Tan,et al. Computer Networks with Compact Routing Tables , 1986 .
[10] Grzegorz Rozenberg,et al. The Book of L , 1986, Springer Berlin Heidelberg.
[11] James Christopher Wyllie,et al. The Complexity of Parallel Computations , 1979 .
[12] Giuseppe F. Italiano,et al. Incremental algorithms for minimal length paths , 1991, SODA '90.
[13] Donald Ervin Knuth,et al. The Art of Computer Programming , 1968 .
[14] Robert E. Tarjan,et al. An Efficient Parallel Biconnectivity Algorithm , 2011, SIAM J. Comput..
[15] Greg N. Frederickson,et al. Fast Algorithms for Shortest Paths in Planar Graphs, with Applications , 1987, SIAM J. Comput..