Incremental Distributed Algorithms for Game-Theoretic Betweenness Centralities in Dynamic Graphs
Authors:
- 16 November 2025
- book chapter
- Published by Springer Nature
- p. 116-128
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Shared-Memory Parallel Algorithms for Fully Dynamic Maintenance of 2-Connected Components2022
- Efficient parallel algorithms for betweenness- and closeness-centrality in dynamic graphs2020
- Space Efficient Incremental Betweenness Algorithm for Directed Graphs2019
- Efficient Computation of Semivalues for Game-Theoretic Network CentralityJournal of Artificial Intelligence Research, 2018
- Parallel Algorithm for Incremental Betweenness Centrality on Large GraphsIEEE Transactions on Parallel and Distributed Systems, 2017
- Efficient algorithms for game-theoretic betweenness centralityArtificial Intelligence, 2016
- Efficient distributed source detection with limited bandwidth2013
- The university of Florida sparse matrix collectionACM Transactions on Mathematical Software, 2011
- A game theoretic approach to measuring degree of centrality in social networksSocial Networks, 1982
- GRAPH THEORY1969