The existence of universally agreed fairest semi-matchings in any given bipartite graph (Q5920163)
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: The existence of universally agreed fairest semi-matchings in any given bipartite graph |
scientific article; zbMATH DE number 6796752
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The existence of universally agreed fairest semi-matchings in any given bipartite graph |
scientific article; zbMATH DE number 6796752 |
Statements
The existence of universally agreed fairest semi-matchings in any given bipartite graph (English)
0 references
23 October 2017
0 references
bipartite graph
0 references
semi-matching
0 references
fairness measure
0 references
partial order
0 references
majorization
0 references
load balancing
0 references
resource allocation
0 references
0.9969475269317628
0 references
0.8070789575576782
0 references
0.8034586310386658
0 references
0.7834433317184448
0 references
0.7783534526824951
0 references
