Maximum matchings in bipartite graphs via strong spanning trees

DOI10.1002/NET.3230210203MaRDI QIDQ3211115zbMATH OpenOpenAlexWikidataFDO

Authors

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

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

Recommendations

• A Competitive Strong Spanning Tree Algorithm for the Maximum Bipartite Matching Problem
• On maximum induced matchings in bipartite graphs
• On maximal bipartite matching extendable graphs
• Maximum semi-matching problem in bipartite graphs
• Maximum matching of given weight in complete and complete bipartite graphs
• Maximizing spectral radius and number of spanning trees in bipartite graphs
• Minimum perfect bipartite matchings and spanning trees under categorization
• Some Results on Matching in Bipartite Graphs
• scientific article; zbMATH DE number 1104328
• On maximal matchings of connected graphs

Cited in

(10)

• Solving linear bottleneck assignment problems via strong spanning trees
• A new strongly polynomial dual network simplex algorithm
• On solving a variation of the assignment problem
• Strongly polynomial simplex algorithm for bipartite vertex packing
• scientific article; zbMATH DE number 434499 (Why is no real title available?)
• A Competitive Strong Spanning Tree Algorithm for the Maximum Bipartite Matching Problem
• A polynomial algorithm to find an independent set of maximum weight in a fork-free graph
• Finding strongly popular \(b\)-matchings in bipartite graphs
• Maximum matching sans maximal matching: a new approach for finding maximum matchings in the data stream model
• Signature classes of transportation polytopes

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3211115)