The existence of universally agreed fairest semi-matchings in any given bipartite graph (Q5918112)
From MaRDI portal
scientific article; zbMATH DE number 7187639
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The existence of universally agreed fairest semi-matchings in any given bipartite graph |
scientific article; zbMATH DE number 7187639 |
Statements
The existence of universally agreed fairest semi-matchings in any given bipartite graph (English)
0 references
7 April 2020
0 references
bipartite graph
0 references
semi-matching
0 references
fairness measure
0 references
partial order
0 references
load balancing
0 references
resource allocation
0 references
0 references
