"On the all-pairs shortest-path algorithm of Moffat and Takaoka."

Kurt Mehlhorn, Volker Priebe (1997)

> Home

Details and statistics

DOI: 10.1002/(SICI)1098-2418(199701/03)10:1/2<205::AID-RSA11>3.0.CO;2-7

access: closed

type: Journal Article

metadata version: 2017-05-26

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/rsa/MehlhornP97
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/rsa/MehlhornP97
Kurt Mehlhorn, Volker Priebe:
On the all-pairs shortest-path algorithm of Moffat and Takaoka. Random Struct. Algorithms 10(1-2): 205-220 (1997)

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.