Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

32

ICPP
1987
IEEE

favoriteEmaildiscussreport

117views Distributed And Parallel Com...» more ICPP 1987»

Parallel Algorithm for Maximum Weight Matching in Trees

14 years 2 months ago

Parallel Algorithm for Maximum Weight Matching in Trees

Download faculty.uncfsu.edu

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).

Shaunak Pawagi

Real-time Traffic

Distributed And Parallel Computing | Efficient Coarse | ICPP 1987 | Maximum Weight Matching | Parallel Algorithm |

claim paper

Related Content

» An adjustable linear time parallel algorithm for maximum weight bipartite matching

» A Parallel Approximation Algorithm for the Weighted Maximum Matching Problem

» Approximating Spanning Trees with Inner Nodes Cost

» Distributed algorithms for covering packing and maximum weighted matching

» Approximating weighted matchings in parallel

» Optimally Locating a Structured Facility of a Specified Length in a Weighted Tree Network

» High Spies or How to Win a Programming Contest

» Approximations to Maximum Weight Matching Scheduling Algorithms of Low Complexity

» A local approximation algorithm for maximum weight matching

Post Info
More Details (n/a)

Added	28 Aug 2010
Updated	28 Aug 2010
Type	Conference
Year	1987
Where	ICPP
Authors	Shaunak Pawagi

Comments (0)