Routing flow through a strongly connected graph (Q1348945)
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: Routing flow through a strongly connected graph |
scientific article; zbMATH DE number 1742804
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Routing flow through a strongly connected graph |
scientific article; zbMATH DE number 1742804 |
Statements
Routing flow through a strongly connected graph (English)
0 references
21 May 2002
0 references
binary blocking flow algorithm
0 references
0.8698832988739014
0 references
0.7959434390068054
0 references
0.7926075458526611
0 references
