On the existence of efficient and fair extensions of communication values for connected graphs (Q1668516)

From MaRDI portal
Revision as of 08:39, 25 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
On the existence of efficient and fair extensions of communication values for connected graphs
scientific article

    Statements

    On the existence of efficient and fair extensions of communication values for connected graphs (English)
    0 references
    0 references
    0 references
    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

    Identifiers