"Partitioning graphs to speedup Dijkstra's algorithm."

Rolf H. Möhring et al. (2006)

> Home

Details and statistics

DOI: 10.1145/1187436.1216585

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/MohringSSWW06
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jea/MohringSSWW06
Rolf H. Möhring, Heiko Schilling, Birk Schütz, Dorothea Wagner, Thomas Willhalm:
Partitioning graphs to speedup Dijkstra's algorithm. ACM J. Exp. Algorithmics 11 (2006)

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.