An adjustable linear time parallel algorithm for maximum weight bipartite matching

15 years 2 months ago

Download www.ece.neu.edu

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

Morteza Fayyazi, David R. Kaeli, Waleed Meleis

Real-time Traffic

Adjustable Time Complexity | IPL 2006 | Maximum Weight | Parallel Algorithm |

claim paper

» Distributed algorithms for covering packing and maximum weighted matching

» Weighted Coloring on Planar Bipartite and Split Graphs Complexity and Improved Approximati...

» Deterministically Isolating a Perfect Matching in Bipartite Planar Graphs

» Linear Time Algorithms for Generalized Edge Dominating Set Problems

» Online scheduling of weighted equallength jobs with hard deadlines on parallel machines

» Evolutionary algorithms and matroid optimization problems

» On TreeConstrained Matchings and Generalizations

» Using Parallel Algorithms for Searching Molecular Sequence Databases

Post Info
More Details (n/a)

Added	13 Dec 2010
Updated	13 Dec 2010
Type	Journal
Year	2006
Where	IPL
Authors	Morteza Fayyazi, David R. Kaeli, Waleed Meleis

Comments (0)

Sciweavers

An adjustable linear time parallel algorithm for maximum weight bipartite matching

Adjustable Time Complexity | IPL 2006 | Maximum Weight | Parallel Algorithm |

Explore & Download

Productivity Tools

Sciweavers