Abstract
The new characterization for maximum matching in bipartite graphs given by Balinski and González is based on “strong spanning trees” and is independent on the classical notion of augmenting path. However, the algorithm that they derived runs in $0( | V | | E | )$ time for bipartite graphs with $| V |$ nodes and $| E |$ edges, and so it is not competitive with the $0( \sqrt {| V |} | E | )$ algorithm of Hopcroft and Karp. In this paper we prove that the basic results given by Hopcroft and Karp can also be obtained using the new characterization, allowing us to develop a competitive algorithm.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
