Massively parallel augmenting path algorithms for the assignment problem (Q1365535)
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: Massively parallel augmenting path algorithms for the assignment problem |
scientific article; zbMATH DE number 1057393
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Massively parallel augmenting path algorithms for the assignment problem |
scientific article; zbMATH DE number 1057393 |
Statements
Massively parallel augmenting path algorithms for the assignment problem (English)
0 references
4 September 1997
0 references
parallel algorithms
0 references
matching in bipartite graphs
0 references
augmenting path algorithms
0 references
dense linear assignment
0 references
0 references
0.9135411977767944
0 references
0.9009255766868592
0 references
