1480 search results - page 34 / 296 » Distributed algorithms for weighted problems in sparse graph... |
118
Voted
KDD
2009
ACM
16 years 1 months ago
2009
ACM
All Netflix Prize algorithms proposed so far are prohibitively costly for large-scale production systems. In this paper, we describe an efficient dataflow implementation of a coll...
129
Voted
SIAMJO
2002
15 years 14 days ago
2002
Given an undirected graph with positive weights on the vertices, the maximum weight clique problem (MWCP) is to find a subset of mutually adjacent vertices (i.e., a clique) having ...
122
Voted
TCS
2008
15 years 22 days ago
2008
Finding, counting and/or listing triangles (three vertices with three edges) in massive graphs are natural fundamental problems, which received recently much attention because of ...
109
click to vote
EVOW
2004
Springer
15 years 6 months ago
2004
Springer
This paper introduces a new social metaheuristic for the Max-Cut problem applied to a weighted undirected graph. This problem consists in finding a partition of the nodes into two ...
ENDM
2008
15 years 27 days ago
2008
In this work we deal with sandwich graphs G = (V, E) and present the notion of vertices f-controlled by a subset M V . We introduce the generalized maxcontrolled set problem (gmc...