376 search results - page 1 / 76 » Betweenness Centrality : Algorithms and Lower Bounds |
CORR
2008
Springer
13 years 11 months ago
2008
Springer
One of the most fundamental problems in large-scale network analysis is to determine the importance of a particular node in a network. Betweenness centrality is the most widely us...
CORR
2008
Springer
13 years 11 months ago
2008
Springer
We study the worst-case communication complexity of distributed algorithms computing a path problem based on stationary distributions of random walks in a network G with the caveat...
ESA
2009
Springer
14 years 5 months ago
2009
Springer
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...
DIALM
2005
ACM
14 years 25 days ago
2005
ACM
Wireless LANs operating within unlicensed frequency bands require random access schemes such as CSMA/CA, so that wireless networks from different administrative domains (for exam...
ESA
1999
Springer
14 years 3 months ago
1999
Springer
Abstract. This paper addresses the informational asymmetry for constructing an ultrametric evolutionary tree from upper and lower bounds on pairwise distances between n given speci...