"Fault-Tolerant Approximate Shortest-Path Trees."

Davide Bilò et al. (2018)

> Home

Details and statistics

DOI: 10.1007/S00453-017-0396-Z

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/BiloGLP18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/algorithmica/BiloGLP18
Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti:
Fault-Tolerant Approximate Shortest-Path Trees. Algorithmica 80(12): 3437-3460 (2018)

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.