"A New Algorithm for Finding all Shortest Paths in a Graph of Positive Arcs ..."

Philip M. Spira (1973)

> Home

Details and statistics

DOI: 10.1137/0202004

access: closed

type: Journal Article

metadata version: 2017-05-27

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/siamcomp/Spira73
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/siamcomp/Spira73
Philip M. Spira:
A New Algorithm for Finding all Shortest Paths in a Graph of Positive Arcs in Average Time 0(n² log²n). SIAM J. Comput. 2(1): 28-32 (1973)

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.