venugopa@yoko.rutgers.edu (Sesh Venugopal) (10/22/90)
I need to know what the current lower bounds are for the weighted bipartite and non-bipartite matching problems. What are the time complexities of the best known algorithms for these? Thanks. Please send mail to venugopa@paul.rutgers.edu --Sesh -- -------------------------------------------------------------------------- Sesh Venugopal venugopa@paul.rutgers.edu Dept. of Computer Science venugopa@aramis.rutgers.edu Rutgers University New Brunswick, NJ 08903