Finding a feasible flow in a strongly connected network (Q1003481)
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: Finding a feasible flow in a strongly connected network |
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
