1480 search results - page 9 / 296 » Distributed algorithms for weighted problems in sparse graph... |
DC
2010
13 years 7 months ago
2010
CORR
2008
Springer
13 years 7 months ago
2008
Springer
We propose a convex-concave programming approach for the labeled weighted graph matching problem. The convex-concave programming formulation is obtained by rewriting the weighted ...
PODC
2006
ACM
14 years 1 months ago
2006
ACM
We study a novel separator property called k-path separable. Roughly speaking, a k-path separable graph can be recursively separated into smaller components by sequentially removi...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
We consider complete graphs with edge weights and/or node weights taking values in some set. In the first part of this paper, we show that a large number of graphs are completely...
NLP
2000
13 years 11 months ago
2000
Abstract. The purpose of this paper is (1) to provide a theoretical justification for the use of Monte-Carlo sampling for approximate resolution of NP-hard maximization problems in...