We present a distributed algorithm that finds a matching M of size which is at least 2/3 M* where M* is a maximum matching in a graph. The algorithm runs in O(log(6) n) steps. (C) 2003 Elsevier B.V. All rights reserved.
展开▼
机译:我们提出一种分布式算法,该算法找到大小至少为2/3 M * 的匹配M,其中M *是图形中的最大匹配。该算法以O(log(6)n)个步骤运行。 (C)2003 Elsevier B.V.保留所有权利。
展开▼