A new algorithm for decremental single-source shortest paths with applications to vertex-capacitated flow and cut problems (Q5212780)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7160518
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.8674285411834717
0 references
0.8458054661750793
0 references
0.8386134505271912
0 references
0.8370295763015747
0 references
0.834904134273529
0 references
