"Computing Many-to-Many Shortest Paths Using Highway Hierarchies."

Sebastian Knopp et al. (2007)

> Home

Details and statistics

DOI: 10.1137/1.9781611972870.4

access: closed

type: Conference or Workshop Paper

metadata version: 2020-09-05

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/alenex/KnoppSSSW07
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/alenex/KnoppSSSW07
Sebastian Knopp, Peter Sanders, Dominik Schultes, Frank Schulz, Dorothea Wagner:
Computing Many-to-Many Shortest Paths Using Highway Hierarchies. ALENEX 2007

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.