Answers are grounded in this paper and cite their sources.
A new characterization of maximum matchings for bipartite graphs is presented. It is based on “strong spanning trees” and permits the development of a new algorithm that does not use the classical notion of augmenting paths and that runs in O (| V | | E |) time for bipartite graphs with | V | nodes and | E | edges.
No takes yet. Share an insight, caveat, or question.
Michel Balinski (1991) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: