"Average-case complexity of shortest-paths problems in the vertex-potential ..."

Colin Cooper et al. (2000)

> Home

Details and statistics

DOI: 10.1002/(SICI)1098-2418(200001)16:1<33::AID-RSA3>3.0.CO;2-0

access: closed

type: Journal Article

metadata version: 2017-11-06

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/rsa/CooperFMP00
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/rsa/CooperFMP00
Colin Cooper, Alan M. Frieze, Kurt Mehlhorn, Volker Priebe:
Average-case complexity of shortest-paths problems in the vertex-potential model. Random Struct. Algorithms 16(1): 33-46 (2000)

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.