Memory-Constrained Algorithms for Shortest Path Problem
暂无分享,去创建一个
We present an algorithm computing a shortest path between to vertices in a square grid graph with edge weights that uses memory less than linear in the number of vertices (apart from that for storing in the input). For any e > 0, our algorithm uses a work space of
[1] Edsger W. Dijkstra,et al. A note on two problems in connexion with graphs , 1959, Numerische Mathematik.
[2] Oded Goldreich,et al. Computational complexity: a conceptual perspective , 2008, SIGA.