Sciweavers

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

85

Voted

SODA
2012
ACM

199views Algorithms» more SODA 2012»

On the communication and streaming complexity of maximum bipartite matching

13 years 5 months ago

On the communication and streaming complexity of maximum bipartite matching

Download www.stanford.edu

Ashish Goel, Michael Kapralov, Sanjeev Khanna

Real-time Traffic

Algorithms | SODA 2012 |

claim paper

Related Content

» Coarse Grained Parallel Maximum Matching In Convex Bipartite Graphs

» On Complexity and Approximability of the Labeled MaximumPerfect Matching Problems

» Low Complexity Outage Optimal Distributed Channel Allocation for VehicletoVehicle Communic...

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

» Bipartite graph matching for video clip localization

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

» Cooperative Spectrum Allocation in Centralized Cognitive Networks Using Bipartite Matching

» The Maximum Communication Complexity of MultiParty Pointer Jumping

» Approximations to Maximum Weight Matching Scheduling Algorithms of Low Complexity

Post Info
More Details (n/a)

Added	28 Sep 2012
Updated	28 Sep 2012
Type	Journal
Year	2012
Where	SODA
Authors	Ashish Goel, Michael Kapralov, Sanjeev Khanna

Comments (0)