Routing flow through a strongly connected graph (Q1348945): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 15:04, 31 January 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