Finding a feasible flow in a strongly connected network (Q1003481): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Changed an Item |
||
| Property / arXiv ID | |||
| Property / arXiv ID: 0711.2710 / rank | |||
Normal rank | |||
Revision as of 18:34, 18 April 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding a feasible flow in a strongly connected network |
scientific article |
Statements
Finding a feasible flow in a strongly connected network (English)
0 references
4 March 2009
0 references
combinatorial algorithms
0 references
network flow
0 references
feasible flow
0 references
strongly connected network
0 references
maximum flow
0 references
