A data parallel augmenting path algorithm for the dense linear many-to-one assignment problem (Q1814992)
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 data parallel augmenting path algorithm for the dense linear many-to-one assignment problem |
scientific article; zbMATH DE number 941245
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A data parallel augmenting path algorithm for the dense linear many-to-one assignment problem |
scientific article; zbMATH DE number 941245 |
Statements
A data parallel augmenting path algorithm for the dense linear many-to-one assignment problem (English)
0 references
23 March 1997
0 references
parallel SIMD computers
0 references
bipartite matching
0 references
semi-assignment
0 references
data parallel primal-dual augmenting path algorithm
0 references
dense linear many-to-one assignment problem
0 references
0 references
0 references
0 references
0.9135411977767944
0 references
0.8483757972717285
0 references
0.8313351273536682
0 references
