Semi-matchings for bipartite graphs and load balancing (Q5491460)
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 5060591
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Semi-matchings for bipartite graphs and load balancing |
scientific article; zbMATH DE number 5060591 |
Statements
Semi-matchings for bipartite graphs and load balancing (English)
0 references
5 October 2006
0 references
bipartite graphs
0 references
load balancing
0 references
matching algorithms
0 references
optimal algorithms
0 references
semi-matching
0 references
0.98820186
0 references
0.9650149
0 references
0 references
0.92188144
0 references
0.9116508
0 references
0.9037857
0 references
0.8929068
0 references
0 references
0 references
0.88729846
0 references
