Routing betweenness centrality

DOI10.1145/1734213.1734219zbMath1327.68027DBLPjournals/jacm/DolevEP10OpenAlexW2047576351WikidataQ56806124 ScholiaQ56806124MaRDI QIDQ3578205

Shlomi Dolev, Rami Puzis, Yuval Elovici

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

communication networkscentralitybetwennessprobabilistic routing

Mathematics Subject Classification ID

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

Related Items (13)

Diffusion centrality: a paradigm to maximize spread in social networks ⋮ Identification of influencers in networks with dynamic behaviors ⋮ Betweenness estimation in OLSR-based multi-hop networks for distributed filtering ⋮ Efficient algorithms for game-theoretic betweenness centrality ⋮ Some results on approximate 1-median selection in metric spaces ⋮ A measure for a balanced workload and its extremal values ⋮ Heuristical top-\(k\): fast estimation of centralities in complex networks ⋮ KADABRA is an ADaptive Algorithm for Betweenness via Random Approximation ⋮ 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

This page was built for publication: Routing betweenness centrality