Sciweavers

2808 search results - page 4 / 562
» Routing betweenness centrality
Sort
View
147
Voted
WAW
2007
Springer
144views Algorithms» more  WAW 2007»
15 years 10 months ago
Approximating Betweenness Centrality
Betweenness is a centrality measure based on shortest paths, widely used in complex network analysis. It is computationally-expensive to exactly determine betweenness; currently th...
David A. Bader, Shiva Kintali, Kamesh Madduri, Mil...
150
Voted
ESA
2009
Springer
122views Algorithms» more  ESA 2009»
15 years 10 months ago
Bounded Budget Betweenness Centrality Game for Strategic Network Formations
In this paper, we introduce the bounded budget betweenness centrality game, a strategic network formation game in which nodes build connections subject to a budget constraint in or...
Xiaohui Bei, Wei Chen, Shang-Hua Teng, Jialin Zhan...
135
Voted
ICPP
2009
IEEE
15 years 1 months ago
A Parallel Algorithm for Computing Betweenness Centrality
In this paper we present a multi-grained parallel algorithm for computing betweenness centrality, which is extensively used in large-scale network analysis. Our method is based on ...
Guangming Tan, Dengbiao Tu, Ninghui Sun
131
Voted
CORR
2010
Springer
107views Education» more  CORR 2010»
15 years 2 months ago
Maximum Betweenness Centrality: Approximability and Tractable Cases
The Maximum Betweenness Centrality problem (MBC) can be defined as follows. Given a graph find a k-element node set C that maximizes the probability of detecting communication be...
Martin Fink, Joachim Spoerhase
127
Voted
NETWORK
2010
122views more  NETWORK 2010»
14 years 10 months ago
Betweenness centrality and resistance distance in communication networks
In this article we report on applications and extensions of weighted graph theory in the design and control of communication networks. We model the communication network as a weig...
Ali Tizghadam, Alberto Leon-Garcia