A new algorithm for decremental single-source shortest paths with applications to vertex-capacitated flow and cut problems (Q5212780)
From MaRDI portal
scientific article; zbMATH DE number 7160518
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A new algorithm for decremental single-source shortest paths with applications to vertex-capacitated flow and cut problems |
scientific article; zbMATH DE number 7160518 |
Statements
A new algorithm for decremental single-source shortest paths with applications to vertex-capacitated flow and cut problems (English)
0 references
30 January 2020
0 references
decremental single-source shortest paths
0 references
sparsest cut
0 references
vertex-capacitated graphs
0 references
