Maximum weight matchings in bipartite graphs

Article View: comp.theory

Article #1752

#1752

From: Ritu Chadha
Date: Mon, 27 May 1991 21:51

14 lines
757 bytes

I am looking for algorithms for finding maximum weight matchings in
weighted bipartite graphs. Can someone give me some relevant references?
What are the best upper bounds on time complexity known for this problem?

Please e-mail responses to chadha@cs.unc.edu

Thanks!

Ritu Chadha
Dept. of Computer Science
University of North Carolina
Chapel Hill, N.C. 27599-3175.

(919) 962-1784.

Technical Details

Message-ID: <4064@borg.cs.unc.edu>

Path: arc1-ca.pugleaf.net!utzoo!utgpu!news-server.csri.toronto.edu!rutgers!mcnc!borg!herbrand!chadha

Show Full Headers

Complete Article Headers

Path: arc1-ca.pugleaf.net!utzoo!utgpu!news-server.csri.toronto.edu!rutgers!mcnc!borg!herbrand!chadha
From: chadha@herbrand.cs.unc.edu (Ritu Chadha)
Newsgroups: comp.theory
Subject: Maximum weight matchings in bipartite graphs
Keywords: Time bound, matchings, bipartite
Message-ID: <4064@borg.cs.unc.edu>
Date: 27 May 91 21:51:54 GMT
Sender: news@cs.unc.edu
Lines: 14