[ACM Press the fifth international works
โ
Nieberg, Tim
๐
Article
๐
2008
๐
ACM Press
โ 339 KB
In this paper, we present and discuss a distributed algorithm for the local message passing communication model that constructs a (1 -ฮต)-approximate Maximum Weight Matching in a graph (ฮต > 0). The approach has a deterministic runtime of O( 1 , where TMIS(m) denotes the distributed time of computing