"Computing Shortest, Fastest, and Foremost Journeys in Dynamic Networks."

Binh-Minh Bui-Xuan, Afonso Ferreira, Aubin Jarry (2003)

> Home

Details and statistics

DOI: 10.1142/S0129054103001728

access: closed

type: Journal Article

metadata version: 2017-05-27

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/ijfcs/XuanFJ03
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ijfcs/XuanFJ03
Binh-Minh Bui-Xuan, Afonso Ferreira, Aubin Jarry:
Computing Shortest, Fastest, and Foremost Journeys in Dynamic Networks. Int. J. Found. Comput. Sci. 14(2): 267-285 (2003)

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.