Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
M. L. Balinski, J. Gonzalez. Maximum matchings in bipartite graphs via strong spanning trees. Networks, 21(2):165-179, 1991. [doi]
Possibly Related PublicationsThe following publications are possibly variants of this publication: A Competitive Strong Spanning Tree Algorithm for the Maximum Bipartite Matching ProblemJaime Gonzalez, Osvaldo Landaeta. siamdm, 8(2):186-195, 1995. [doi]
The following publications are possibly variants of this publication: