196 search results - page 3 / 40 » Approximating weighted matchings in parallel |
COLOGNETWENTE
2008
13 years 7 months ago
2008
FOCS
2010
IEEE
13 years 4 months ago
2010
IEEE
WDAG
2004
Springer
13 years 11 months ago
2004
Springer
Abstract. In this paper, we present fast and fully distributed algorithms for matching in weighted trees and general weighted graphs. The time complexity as well as the approximati...
IPL
2006
13 years 6 months ago
2006
We present a parallel algorithm for finding a maximum weight matching in general bipartite graphs with an adjustable time complexity of O(n ) using O(nmax(2,4+)) processing
ICPP
1987
IEEE
13 years 9 months ago
1987
IEEE
We present an efficient coarse grained parallel algorithm for computing a maximum weight matching in trees. A divide and conquer approach based on centroid decomposition of trees ...