"Finding single-source shortest p-disjoint paths: fast computation and ..."

Davide Bilò et al. (2021)

> Home

Details and statistics

DOI: —

access: open

type: Informal or Other Publication

metadata version: 2021-06-30

- view
  - electronic edition @ arxiv.org (open access)
- export record
  dblp key:
  - journals/corr/abs-2106-12293
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2106-12293
Davide Bilò, Gianlorenzo D'Angelo, Luciano Gualà, Stefano Leucci, Guido Proietti, Mirko Rossi:
Finding single-source shortest p-disjoint paths: fast computation and sparse preservers. CoRR abs/2106.12293 (2021)

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.