"Computing the nxm Shortest Paths Efficiently."

Tetsuo Shibuya (2000)

> Home

Details and statistics

DOI: 10.1145/351827.384251

access: closed

type: Journal Article

metadata version: 2020-06-25

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jea/Shibuya00
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jea/Shibuya00
Tetsuo Shibuya:
Computing the nxm Shortest Paths Efficiently. ACM J. Exp. Algorithmics 5: 9 (2000)

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.