Engineering fast algorithms for the bottleneck matching problem (Q6657052)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7961932
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Engineering fast algorithms for the bottleneck matching problem |
scientific article; zbMATH DE number 7961932 |
Statements
Engineering fast algorithms for the bottleneck matching problem (English)
0 references
6 January 2025
0 references
bipartite graphs
0 references
assignment problem
0 references
matching
0 references
