"I/O-efficient shortest path algorithms for undirected graphs with random ..."

Ulrich Meyer, Norbert Zeh (2012)

> Home

Details and statistics

DOI: 10.1145/2229163.2229166

access: closed

type: Journal Article

metadata version: 2018-11-06

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/talg/MeyerZ12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/talg/MeyerZ12
Ulrich Meyer, Norbert Zeh:
I/O-efficient shortest path algorithms for undirected graphs with random or bounded edge lengths. ACM Trans. Algorithms 8(3): 22:1-22:28 (2012)

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.