Topology manipulations for speeding betweenness centrality computation

DOI10.1093/comnet/cnu015zbMath1397.68007OpenAlexW2141641104MaRDI QIDQ4689353

Rami Puzis, Polina Zilberman, Shlomi Dolev, Ulrik Brandes, Yuval Elovici

Publication date: 16 October 2018

Published in: Journal of Complex Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/comnet/cnu015

zbMATH Keywords

betweenness centralitytopology reductionstructural analysis of networks

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (6)

Dynamic Merging of Frontiers for Accelerating the Evaluation of Betweenness Centrality ⋮ Towards classifying the polynomial-time solvability of temporal betweenness centrality ⋮ Towards Classifying the Polynomial-Time Solvability of Temporal Betweenness Centrality ⋮ An Adaptive Version of Brandes' Algorithm for Betweenness Centrality ⋮ Fully Polynomial FPT Algorithms for Some Classes of Bounded Clique-width Graphs ⋮ A Faster Algorithm to Update Betweenness Centrality After Node Alteration

This page was built for publication: Topology manipulations for speeding betweenness centrality computation