Finding All Shortest Distances in a Directed Network

DOI10.1147/RD.164.0412MaRDI QIDQ4401749zbMATH OpenOpenAlexFDO

Authors Alan J. Hoffman, Shmuel Winograd

Publication date 1972

Published in IBM Journal of Research and Development (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1147/rd.164.0412

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Extremal problems in graph theory (05C35)

Cited in

(1)

• A very personal reminiscence on the problem of computational complexity

This page was built for publication: Finding All Shortest Distances in a Directed Network

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4401749)