On the existence of efficient and fair extensions of communication values for connected graphs (Q1668516)
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: On the existence of efficient and fair extensions of communication values for connected graphs |
scientific article; zbMATH DE number 6928435
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the existence of efficient and fair extensions of communication values for connected graphs |
scientific article; zbMATH DE number 6928435 |
Statements
On the existence of efficient and fair extensions of communication values for connected graphs (English)
0 references
29 August 2018
0 references
communication graph
0 references
fairness
0 references
efficiency
0 references
efficient extension
0 references
fair extension
0 references
myerson value
0 references
