A dual graph algorithm model and its implementation of the maximum flow on the large-scale networks (Q3071575)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5846628
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A dual graph algorithm model and its implementation of the maximum flow on the large-scale networks |
scientific article; zbMATH DE number 5846628 |
Statements
5 February 2011
0 references
max-flow min-cut
0 references
network flow graph
0 references
dual graph
0 references
the shortest path
0 references
0.7729943990707397
0 references
0.7633401155471802
0 references
0.7560210824012756
0 references
0.7548041343688965
0 references
