Pages that link to "Item:Q899439"
From MaRDI portal
The following pages link to Efficient algorithms for game-theoretic betweenness centrality (Q899439):
Displaying 14 items.
- Parallelization of game theoretic centrality algorithms (Q301779) (← links)
- Bounded budget betweenness centrality game for strategic network formations (Q655424) (← links)
- Centrality and power in social networks: A game theoretic approach. (Q1402484) (← links)
- Analyzing power in weighted voting games with super-increasing weights (Q1733386) (← links)
- Tournament solutions based on cooperative game theory (Q2178642) (← links)
- On network analysis using non-additive integrals: extending the game-theoretic network centrality (Q2317521) (← links)
- Attachment centrality: measure for connectivity in networks (Q2321314) (← links)
- Analyzing Power in Weighted Voting Games with Super-Increasing Weights (Q2819457) (← links)
- Routing betweenness centrality (Q3578205) (← links)
- Efficient Computation of Semivalues for Game-Theoretic Network Centrality (Q4963217) (← links)
- Algebraic Algorithms for Betweenness and Percolation Centrality (Q4994345) (← links)
- Game of Thieves and WERW-Kpath: Two Novel Measures of Node and Edge Centrality for Mafia Networks (Q5050954) (← links)
- Braess' paradox: A cooperative game‐theoretic point of view (Q6065828) (← links)
- Directed communication in games with directed graphs (Q6081614) (← links)