Hoffman, A. J.; Winograd, S. Finding all shortest distances in a directed network. (English) Zbl 0276.90059 IBM J. Res. Dev. 16, 412-414 (1972). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 1 Document MSC: 90C35 Programming involving graphs or networks 05C35 Extremal problems in graph theory 90B10 Deterministic network models in operations research PDF BibTeX XML Cite \textit{A. J. Hoffman} and \textit{S. Winograd}, IBM J. Res. Dev. 16, 412--414 (1972; Zbl 0276.90059) Full Text: DOI OpenURL