76 search results - page 1 / 16 » Distributed Current Flow Betweenness Centrality |
STACS
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. We consider variations of two well-known centrality measures, betweenness and closeness, with a different model of information spread. Rather than along shortest paths o...
ICPP
2009
IEEE
13 years 2 months ago
2009
IEEE
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 ...
TON
2008
13 years 3 months ago
2008
Given a set of demands between pairs of nodes, we examine the traffic engineering problem of flow routing and fair bandwidth allocation where flows can be split to multiple paths ...
APNOMS
2006
Springer
13 years 8 months ago
2006
Springer
In a large-scale backbone networks, the traffic monitoring system needs to receive a large volume of flow records, so if a single central collecting process is used, it might not b...
ICPP
2006
IEEE
13 years 10 months ago
2006
IEEE
This paper discusses fast parallel algorithms for evaluating several centrality indices frequently used in complex network analysis. These algorithms have been optimized to exploi...