Efficient algorithms for game-theoretic betweenness centrality (Q899439): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.artint.2015.11.001 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1948447363 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Accessibility in oriented networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Least-Core of Threshold Network Flow Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Effort Games and the Price of Myopia / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the most vital arcs in a network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Emergence of Scaling in Random Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A faster algorithm for betweenness centrality* / rank
 
Normal rank
Property / cites work
 
Property / cites work: Most vital links and nodes in weighted networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2747613 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic Network Interdiction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Routing betweenness centrality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3267900 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The centrality of groups and classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Community structure in social and biological networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Centrality and power in social networks: A game theoretic approach. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Network Problems Yielding Totally Balanced Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Totally Balanced Games and Games of Flow / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cooperative game theoretic centrality analysis of terrorist networks: the cases of Jemaah Islamiyah and Al Qaeda / rank
 
Normal rank
Property / cites work
 
Property / cites work: The k most vital arcs in the shortest path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Game Theory / 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: Transversality of the Shapley value / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs and Cooperation in Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5852580 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5817870 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3528714 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5283048 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Collective dynamics of ‘small-world’ networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monotonic solutions of cooperative games / rank
 
Normal rank

Latest revision as of 06:58, 11 July 2024

scientific article
Language Label Description Also known as
English
Efficient algorithms for game-theoretic betweenness centrality
scientific article

    Statements

    Efficient algorithms for game-theoretic betweenness centrality (English)
    0 references
    0 references
    0 references
    0 references
    28 December 2015
    0 references
    betweenness centrality
    0 references
    Shapley value
    0 references
    semivalue
    0 references

    Identifiers

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