"Average-case complexity of single-source shortest-paths algorithms: lower ..."

Ulrich Meyer (2003)

> Home

Details and statistics

DOI: 10.1016/S0196-6774(03)00046-4

access: closed

type: Journal Article

metadata version: 2017-08-14

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jal/Meyer03
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jal/Meyer03
Ulrich Meyer:
Average-case complexity of single-source shortest-paths algorithms: lower and upper bounds. J. Algorithms 48(1): 91-134 (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.