Community based node betweenness centrality updating algorithms in dynamic networks

DOI10.13328/J.CNKI.JOS.005457MaRDI QIDQ4688896zbMATH OpenFDO

Authors Jun Qian, Chao-Kun Wang, Gaoyang Guo

Publication date 22 October 2018

Full work available at URL https://doi.org/10.13328/J.CNKI.JOS.005457

zbMATH Keywords

communitydynamic networknode betweenness centralityshortest distance

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30)

Recommendations

• scientific article; zbMATH DE number 6917138
• A faster algorithm to update betweenness centrality after node alteration
• A Faster Algorithm to Update Betweenness Centrality after Node Alteration
• Efficient algorithms for updating betweenness centrality in fully dynamic graphs
• Local community detection in dynamic graphs using personalized centrality

Cited in

(9)

• Local community detection in dynamic graphs using personalized centrality
• Efficient algorithms for updating betweenness centrality in fully dynamic graphs
• Distributed centrality analysis of social network data using MapReduce
• Force-based incremental algorithm for mining community structure in dynamic network
• A Faster Algorithm to Update Betweenness Centrality after Node Alteration
• scientific article; zbMATH DE number 6917138 (Why is no real title available?)
• A stable decomposition algorithm for dynamic social network analysis
• A faster algorithm to update betweenness centrality after node alteration
• Approximating Betweenness Centrality in Fully Dynamic Networks

This page was built for publication: Community based node betweenness centrality updating algorithms in dynamic networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4688896)