"Temporal shortest paths: Parallel computing implementations."

Nicolas Tremblay, Michael Florian (2001)

> Home

Details and statistics

DOI: 10.1016/S0167-8191(01)00107-7

access: closed

type: Journal Article

metadata version: 2020-02-22

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/pc/TremblayF01
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/pc/TremblayF01
Nicolas Tremblay, Michael Florian:
Temporal shortest paths: Parallel computing implementations. Parallel Comput. 27(12): 1569-1609 (2001)

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.