Routing betweenness centrality

DOI10.1145/1734213.1734219MaRDI QIDQ3578205zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Shlomi Dolev, Yuval Elovici, Rami Puzis

Publication date 14 July 2010

Published in Journal of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1734213.1734219

zbMATH Keywords

betwennesscentralitycommunication networksprobabilistic routing

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• STACS 2005
• Alpha current flow betweenness centrality
• Efficient algorithms for game-theoretic betweenness centrality
• Approximating Betweenness Centrality
• An Adaptive Version of Brandes' Algorithm for Betweenness Centrality

Cited in

(21)

• Fast approximation of betweenness centrality through sampling
• Efficient algorithms for updating betweenness centrality in fully dynamic graphs
• Application of complex networks theory in urban traffic network researches
• Estimating user influence ranking in independent cascade model
• Learning centrality by learning to route
• Identification of influencers in networks with dynamic behaviors
• Heuristical top-\(k\): fast estimation of centralities in complex networks
• Localized bridging centrality
• Alpha current flow betweenness centrality
• Diffusion centrality: a paradigm to maximize spread in social networks
• Betweenness estimation in OLSR-based multi-hop networks for distributed filtering
• Some results on approximate 1-median selection in metric spaces
• KADABRA is an ADaptive Algorithm for Betweenness via Random Approximation
• Paths and flows for centrality measures in networks
• A survey on optimization studies of group centrality metrics
• Shapley value to rank vulnerabilities on attack graphs: applications to cyberdeception
• Exploring multi-layered networks through random walks: bridging offline optimization and online learning
• Performances and correlations of centrality measures in complex networks
• Efficient algorithms for game-theoretic betweenness centrality
• A measure for a balanced workload and its extremal values
• Incremental deployment of network monitors based on Group Betweenness Centrality

This page was built for publication: Routing betweenness centrality

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