1095 search results - page 186 / 219 » A Parallel Algorithm for Computing Betweenness Centrality |
151
click to vote
ATAL
2010
Springer
15 years 3 months ago
2010
Springer
Establishing trust amongst agents is of central importance to the development of well-functioning multi-agent systems. For example, the anonymity of transactions on the Internet c...
128
click to vote
KDD
2006
ACM
16 years 2 months ago
2006
ACM
Given a huge real graph, how can we derive a representative sample? There are many known algorithms to compute interesting measures (shortest paths, centrality, betweenness, etc.)...
APPT
2007
Springer
15 years 8 months ago
2007
Springer
We investigate the problem of constructing the maximal number of node disjoint paths between two distinct nodes in Swapped/OTIS networks. A general construction of node disjoint pa...
141
click to vote
SIGMETRICS
2011
ACM
14 years 9 months ago
2011
ACM
In recent years the High Performance Computing (HPC) industry has benefited from the development of higher density multi-core processors. With recent chips capable of executing u...
132
click to vote
TC
2010
14 years 9 months ago
2010
Abstract-- Scheduling problems are already difficult on traditional parallel machines, and they become extremely challenging on heterogeneous clusters. In this paper we deal with t...