A simpler and faster strongly polynomial algorithm for generalized flow maximization (Q4977964)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A simpler and faster strongly polynomial algorithm for generalized flow maximization |
scientific article; zbMATH DE number 6761801
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A simpler and faster strongly polynomial algorithm for generalized flow maximization |
scientific article; zbMATH DE number 6761801 |
Statements
A simpler and faster strongly polynomial algorithm for generalized flow maximization (English)
0 references
17 August 2017
0 references
generalized flow
0 references
network flow
0 references
strongly polynomial algorithm
0 references
flow maximization
0 references
0.9857250452041626
0 references
0.905264377593994
0 references
0.9032809734344482
0 references
0.8300344347953796
0 references
