Routing flow through a strongly connected graph (Q1348945): Difference between revisions
From MaRDI portal
Removed claims |
Changed an Item |
||
| Property / author | |||
| Property / author: Erlebach, Thomas / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: Torben Hagerup / rank | |||
Normal rank | |||
Revision as of 23:25, 9 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Routing flow through a strongly connected graph |
scientific article |
Statements
Routing flow through a strongly connected graph (English)
0 references
21 May 2002
0 references
binary blocking flow algorithm
0 references
