"A Theorem on the Expected Complexity of Dijkstra's Shortest Path Algorithm."

Kohei Noshita (1985)

> Home

Details and statistics

DOI: 10.1016/0196-6774(85)90009-4

access: closed

type: Journal Article

metadata version: 2017-05-28

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jal/Noshita85
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jal/Noshita85
Kohei Noshita:
A Theorem on the Expected Complexity of Dijkstra's Shortest Path Algorithm. J. Algorithms 6(3): 400-408 (1985)

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.