Algorithms and complexity for the almost equal maximum flow problem (Q6541024)
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: Algorithms and complexity for the almost equal maximum flow problem |
scientific article; zbMATH DE number 7850608
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Algorithms and complexity for the almost equal maximum flow problem |
scientific article; zbMATH DE number 7850608 |
Statements
Algorithms and complexity for the almost equal maximum flow problem (English)
0 references
17 May 2024
0 references
computational complexity
0 references
equal-flow problem
0 references
integral solutions
0 references
maximum flows
0 references
network flows
0 references
parametric search
0 references
