"Finding the k Shortest Paths in Parallel."

Eric Ruppert (2000)

> Home

Details and statistics

DOI: 10.1007/S004530010038

access: closed

type: Journal Article

metadata version: 2017-05-17

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/algorithmica/Ruppert00
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/algorithmica/Ruppert00
Eric Ruppert:
Finding the k Shortest Paths in Parallel. Algorithmica 28(2): 242-254 (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.