"Maintaining Shortest Paths in Digraphs with Arbitrary Arc Weights: An ..."

Camil Demetrescu et al. (2000)

> Home

Details and statistics

DOI: 10.1007/3-540-44691-5_19

access: closed

type: Conference or Workshop Paper

metadata version: 2024-08-04

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/wae/DemetrescuFMN00
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/wae/DemetrescuFMN00
Camil Demetrescu, Daniele Frigioni, Alberto Marchetti-Spaccamela, Umberto Nanni:
Maintaining Shortest Paths in Digraphs with Arbitrary Arc Weights: An Experimental Study. WAE 2000: 218-229

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.