Incremental deployment of network monitors based on Group Betweenness Centrality

DOI10.1016/J.IPL.2009.07.019zbMath1209.68364arXiv0904.0352OpenAlexW2055438560MaRDI QIDQ990953

Yuval Elovici, Rami Puzis, Polina Zilberman, Shlomi Dolev

Publication date: 1 September 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0904.0352

zbMATH Keywords

distributed systemsinterconnection networksgraph algorithmsnetwork centralitygroup betweenness

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (8)

Novel centrality metrics for studying essentiality in protein‐protein interaction networks based on group structures ⋮ Finding groups with maximum betweenness centrality via integer programming with random path sampling ⋮ Heuristical top-\(k\): fast estimation of centralities in complex networks ⋮ Potential-based bounded-cost search and anytime non-parametric A* ⋮ Maximum Betweenness Centrality: Approximability and Tractable Cases ⋮ An integer programming approach for finding the most and the least central cliques ⋮ Group centralization of network indices ⋮ Finding groups with maximum betweenness centrality

Cites Work

• Unnamed Item
• A faster algorithm for betweenness centrality*
• Emergence of Scaling in Random Networks
• A threshold of ln n for approximating set cover
• The centrality of groups and classes
• CONGESTION AND CENTRALITY IN TRAFFIC FLOW ON COMPLEX NETWORKS

This page was built for publication: Incremental deployment of network monitors based on Group Betweenness Centrality