3105 search results - page 486 / 621 » The Path-Packing Structure of Graphs |
134
Voted
ICPP
2009
IEEE
15 years 1 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 ...
123
Voted
ICPP
2009
IEEE
15 years 1 months ago
2009
IEEE
In this paper we work on the parallelization of the inherently serial Dijkstra's algorithm on modern multicore platforms. Dijkstra's algorithm is a greedy algorithm that ...
133
Voted
FIRSTMONDAY
2010
15 years 1 months ago
2010
Online Social Networks (OSNs) have been the subject of a great deal of study in recent years. The majority of this study has used simple models, such as node-and-edge graphs, to d...
145
Voted
AUTOMATICA
2011
14 years 10 months ago
2011
Iterative distributed algorithms are studied for computing arithmetic averages over networks of agents connected through memoryless broadcast erasure channels. These algorithms do...
184
Voted
TC
2011
14 years 10 months ago
2011
—Aggressive technology scaling to 45nm and below introduces serious reliability challenges to the design of microprocessors. Since a large fraction of chip area is devoted to on-...