Fast Algorithms for Bipartite Network Flow (Q3754450)
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: Fast Algorithms for Bipartite Network Flow |
scientific article; zbMATH DE number 4001889
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Fast Algorithms for Bipartite Network Flow |
scientific article; zbMATH DE number 4001889 |
Statements
Fast Algorithms for Bipartite Network Flow (English)
0 references
1987
0 references
maximum flow
0 references
bipartite graph
0 references
upper bound for the complexity
0 references
multiprocessor scheduling
0 references
release times and deadlines
0 references
maximum subgraph density
0 references
weighted subgraph density
0 references
0.897835373878479
0 references
0.8403643369674683
0 references
0.8311595320701599
0 references
