chadha@herbrand.cs.unc.edu (Ritu Chadha) (05/28/91)
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.