Journal of the ACM Bibliography

Jin Y. Yen. Finding the lengths of all shortest paths in N-node nonnegative-distance complete networks using (N^3)/2 additions and N^3 comparisons. Journal of the ACM, 19(3):423-424, July 1972. [BibTeX entry]
Additional Key Words and Phrases: shortest network paths, graph and network theory

Selected papers that cite this one


Shortcuts:

  • Journal of the ACM homepage
  • Bibliography top level
  • Journal of the ACM Author Index
  • Search the HBP database