Parallel Algorithm for Maximum Weight Matching in Trees

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 is used. Our algorithm requires O(log2 p) communication rounds with pO p n log local computation and p n O memory per processor (where p is the number of processors used and n is the size of the tree).

• Type: Conference
• Year: 1987
• Where: ICPP
• Authors: Shaunak Pawagi
• Keywords: Distributed And Parallel Computing, Efficient Coarse, ICPP 1987, Maximum Weight Matching, Parallel Algorithm