Maximum matchings in bipartite graphs via strong spanning trees

DOI10.1002/net.3230210203zbMath0722.90058OpenAlexW2062308245WikidataQ56626052 ScholiaQ56626052MaRDI QIDQ3211115

No author found.

Publication date: 1991

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.3230210203

zbMATH Keywords

bipartite graphsmaximum matchingsstrong spanning trees

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60) Combinatorial optimization (90C27) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (7)

A new strongly polynomial dual network simplex algorithm ⋮ Strongly polynomial simplex algorithm for bipartite vertex packing ⋮ On solving a variation of the assignment problem ⋮ Maximum matching sans maximal matching: a new approach for finding maximum matchings in the data stream model ⋮ A polynomial algorithm to find an independent set of maximum weight in a fork-free graph ⋮ Solving linear bottleneck assignment problems via strong spanning trees ⋮ Signature classes of transportation polytopes

This page was built for publication: Maximum matchings in bipartite graphs via strong spanning trees