Finding a feasible flow in a strongly connected network (Q1003481): Difference between revisions
From MaRDI portal
Changed an Item |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1016/j.orl.2008.02.003 / rank | |||
| Property / cites work | |||
| Property / cites work: Routing flow through a strongly connected graph / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Beyond the flow decomposition barrier / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Wheels within wheels / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Depth-First Search and Linear Graph Algorithms / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Efficiency of a Good But Not Linear Set Union Algorithm / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.ORL.2008.02.003 / rank | |||
Normal rank | |||
Latest revision as of 12:22, 10 December 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
