A new algorithm for decremental single-source shortest paths with applications to vertex-capacitated flow and cut problems (Q5212780): Difference between revisions
From MaRDI portal
Set profile property. |
Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2950039944 / rank | |||
Normal rank | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 1905.11512 / rank | |||
Normal rank | |||
Latest revision as of 00:53, 20 April 2024
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
