A Simpler and Faster Strongly Polynomial Algorithm for Generalized Flow Maximization (Q5133966): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: Publication / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W3021764208 / rank | |||
Normal rank | |||
Latest revision as of 01:42, 20 March 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
