Efficient Computation of Betweenness Centrality by Graph Decompositions and Their Applications to Real-World Networks.
Tatsuya InohaKunihiko SadakaneYushi UnoYuma YonebayashiPublished in: IEICE Trans. Inf. Syst. (2022)
Keyphrases
- betweenness centrality
- efficient computation
- real world networks
- complex networks
- network structure
- social networks
- community structure
- community detection
- dynamic networks
- graph theory
- social and information networks
- computational efficiency
- shortest path
- network analysis
- link prediction
- social network analysis
- heterogeneous networks
- community discovery
- overlapping communities
- data sets
- graph partitioning
- text mining
- active learning
- recommender systems
- learning algorithm