Parallel algorithms for the assignment and minimum-cost flow problems (Q1319670): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q59592645, #quickstatements; #temporary_batch_1704755592590 |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 13:07, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Parallel algorithms for the assignment and minimum-cost flow problems |
scientific article |
Statements
Parallel algorithms for the assignment and minimum-cost flow problems (English)
0 references
12 April 1994
0 references
parallel algorithm
0 references
scaling
0 references
assignment problem
0 references
bipartite matching
0 references
minimum-cost flow
0 references
