A modified Myerson value for determining the centrality of graph vertices (Q2660510): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Q3197645 / rank
 
Normal rank
Property / cites work
 
Property / cites work: STACS 2005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Networking Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating functions and the Myerson vector in communication networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Computation of the Shapley Value for Game-Theoretic Network Centrality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs and Cooperation in Games / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1134/s0005117921010100 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3134978574 / rank
 
Normal rank

Latest revision as of 09:44, 30 July 2024

scientific article
Language Label Description Also known as
English
A modified Myerson value for determining the centrality of graph vertices
scientific article

    Statements

    A modified Myerson value for determining the centrality of graph vertices (English)
    0 references
    0 references
    0 references
    30 March 2021
    0 references
    graphs
    0 references
    paths with cycles
    0 references
    centrality measures
    0 references
    cooperative game
    0 references
    Myerson value
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references