Single-source shortest \(p\)-disjoint paths: fast computation and sparse preservers (Q6490964)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Single-source shortest \(p\)-disjoint paths: fast computation and sparse preservers |
scientific article; zbMATH DE number 7836579
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Single-source shortest \(p\)-disjoint paths: fast computation and sparse preservers |
scientific article; zbMATH DE number 7836579 |
Statements
Single-source shortest \(p\)-disjoint paths: fast computation and sparse preservers (English)
0 references
23 April 2024
0 references
multipath spanners
0 references
graph sparsification
0 references
edge-disjoint paths
0 references
min-cost flow
0 references
