Improved Algorithms for Network Shortest Paths Problem

Xiao Wang · Mini-micro Systems · 2002

This paper discusses the design and implementation strategies of the famous Dijkstra shortest paths algorithm. The new techniques suggested improve the time and space complexities of the shortest paths algorithm significantly.

Read the paper · More papers on PaperTik