"Single-Source Shortest p-Disjoint Paths: Fast Computation and Sparse ..."

Davide Bilò et al. (2022)

> Home

Details and statistics

DOI: 10.4230/LIPICS.STACS.2022.12

access: open

type: Conference or Workshop Paper

metadata version: 2022-06-23

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - conf/stacs/BiloDG0PR22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/stacs/BiloDG0PR22
Davide Bilò, Gianlorenzo D'Angelo, Luciano Gualà, Stefano Leucci, Guido Proietti, Mirko Rossi:
Single-Source Shortest p-Disjoint Paths: Fast Computation and Sparse Preservers. STACS 2022: 12:1-12:21

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.