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

Davide Bilò, Gianlorenzo D'Angelo, Luciano Gualà, Stefano Leucci 0001, Guido Proietti, Mirko Rossi. Single-Source Shortest p-Disjoint Paths: Fast Computation and Sparse Preservers. In Petra Berenbrink, Benjamin Monmege, editors, 39th International Symposium on Theoretical Aspects of Computer Science, STACS 2022, March 15-18, 2022, Marseille, France (Virtual Conference). Volume 219 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. [doi]

Abstract

Abstract is missing.