1480 search results - page 1 / 296 » Distributed algorithms for weighted problems in sparse graph... |
JDA
2006
13 years 5 months ago
2006
PPAM
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. We consider the problem of computing a weighted edge matching in a large graph using a parallel algorithm. This problem has application in several areas of combinatorial ...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
Given an undirected graph G and an error parameter > 0, the graph sparsification problem requires sampling edges in G and giving the sampled edges appropriate weights to obtai...
APPROX
2004
Springer
13 years 10 months ago
2004
Springer
ABSTRACT: Let G(n, c/n) and Gr(n) be an n-node sparse random graph and a sparse random rregular graph, respectively, and let I(n, r) and I(n, c) be the sizes of the largest indepen...
ICASSP
2011
IEEE
12 years 9 months ago
2011
IEEE
We design two different strategies for computing the unknown content preferences in an online social network based on a small set of nodes in the corresponding social graph for wh...