Game-theoretic centrality measures for weighted graphs
From MaRDI portal
(Redirected from Publication:4976402)
Recommendations
- Centrality and power in social networks: A game theoretic approach.
- Efficient algorithms for game-theoretic betweenness centrality
- Modified Myerson value for determining the centrality of graph vertices
- A modified Myerson value for determining the centrality of graph vertices
- A centrality measure for networks with community structure based on a generalization of the Owen value
Cited in
(14)- Centrality and power in social networks: A game theoretic approach.
- On network analysis using non-additive integrals: extending the game-theoretic network centrality
- Hitting a path: a generalization of weighted connectivity via game theory
- A modified Myerson value for determining the centrality of graph vertices
- Parallelization of game theoretic centrality algorithms
- Game of thieves and WERW-Kpath: two novel measures of node and edge centrality for mafia networks
- Some properties of transportation network cooperative games
- Modified Myerson value for determining the centrality of graph vertices
- A centrality measure for networks with community structure based on a generalization of the Owen value
- Directed communication in games with directed graphs
- Analyzing the Zerkani network with the Owen value
- Centrality measures and opinion dynamics in two-layer networks with replica nodes
- Clique based centrality measure in hypergraphs
- Efficient algorithms for game-theoretic betweenness centrality
This page was built for publication: Game-theoretic centrality measures for weighted graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4976402)
