"A Faster Computation of All the Best Swap Edges of a Shortest Paths Tree."

Davide Bilò, Luciano Gualà, Guido Proietti (2015)

> Home

Details and statistics

DOI: 10.1007/S00453-014-9912-6

access: closed

type: Journal Article

metadata version: 2022-06-23

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/algorithmica/BiloGP15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/algorithmica/BiloGP15
Davide Bilò, Luciano Gualà, Guido Proietti:
A Faster Computation of All the Best Swap Edges of a Shortest Paths Tree. Algorithmica 73(3): 547-570 (2015)

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.