554 search results - page 1 / 111 » Optimizing in Graphs with Expensive Computation of Edge Weig... |
OR
2007
Springer
14 years 1 months ago
2007
Springer
ICDM
2010
IEEE
13 years 5 months ago
2010
IEEE
The growth of the web has directly influenced the increase in the availability of relational data. One of the key problems in mining such data is computing the similarity between o...
IPL
2006
13 years 7 months ago
2006
We consider a special subgraph of a weighted directed graph: one comprising only the k heaviest edges incoming to each vertex. We show that the maximum weight branching in this su...
TAMC
2010
Springer
14 years 15 days ago
2010
Springer
An instance of the max k−cut game is an edge weighted graph. Every
PPAM
2007
Springer
14 years 1 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 ...