A parametric maximum flow algorithm for bipartite graphs with applications (Q1129980)
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: A parametric maximum flow algorithm for bipartite graphs with applications |
scientific article; zbMATH DE number 1191329
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A parametric maximum flow algorithm for bipartite graphs with applications |
scientific article; zbMATH DE number 1191329 |
Statements
A parametric maximum flow algorithm for bipartite graphs with applications (English)
0 references
16 August 1998
0 references
bipartite graph
0 references
maximum flow
0 references
parametric algorithm
0 references
capacitated bipartite network
0 references
0.8082073926925659
0 references
0.7490739822387695
0 references
0.7484663724899292
0 references
0.7480407357215881
0 references
0.7462289929389954
0 references
