A Simpler and Faster Strongly Polynomial Algorithm for Generalized Flow Maximization (Q5133966): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 14:11, 8 February 2024
scientific article; zbMATH DE number 7273081
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Simpler and Faster Strongly Polynomial Algorithm for Generalized Flow Maximization |
scientific article; zbMATH DE number 7273081 |
Statements
A Simpler and Faster Strongly Polynomial Algorithm for Generalized Flow Maximization (English)
0 references
11 November 2020
0 references
generalized flow
0 references
network flow
0 references
strongly polynomial
0 references
