Single-source shortest p-disjoint paths: fast computation and sparse preservers

DOI10.4230/LIPICS.STACS.2022.12MaRDI QIDQ6490964zbMATH OpenFDO

Authors D. Bilò, Gianlorenzo D'Angelo, Luciano Gualà, Stefano Leucci, Guido Proietti, Mirko Rossi

Publication date 23 April 2024

zbMATH Keywords

edge-disjoint pathsmin-cost flowgraph sparsificationmultipath spanners

Mathematics Subject Classification ID

Theory of computing (68Qxx)

This page was built for publication: Single-source shortest \(p\)-disjoint paths: fast computation and sparse preservers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6490964)