"Finding the Lengths of All Shortest paths in N-Node Nonnegative-Distance ..."

Jin Y. Yen (1972)

> Home

Details and statistics

DOI: 10.1145/321707.321712

access: closed

type: Journal Article

metadata version: 2018-11-06

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jacm/Yen72
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jacm/Yen72
Jin Y. Yen:
Finding the Lengths of All Shortest paths in N-Node Nonnegative-Distance Complete Networks Using ½N³ Additions and N³ Comparisons. J. ACM 19(3): 423-424 (1972)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.