A theoretical and experimental study of a new algorithm for minimum cost flow in dynamic graphs (Q2664011)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A theoretical and experimental study of a new algorithm for minimum cost flow in dynamic graphs |
scientific article |
Statements
A theoretical and experimental study of a new algorithm for minimum cost flow in dynamic graphs (English)
0 references
20 April 2021
0 references
dynamic graph
0 references
minimum cost flow
0 references
successive shortest path algorithm
0 references
