Fredman, Michael L. New bounds on the complexity of the shortest path problem. (English) Zbl 0326.68027 SIAM J. Comput. 5, 83-89 (1976). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 5 ReviewsCited in 53 Documents MSC: 68Q25 Analysis of algorithms and problem complexity 68W99 Algorithms in computer science 05C35 Extremal problems in graph theory PDFBibTeX XMLCite \textit{M. L. Fredman}, SIAM J. Comput. 5, 83--89 (1976; Zbl 0326.68027) Full Text: DOI