Solving a combinatorial problem with network flows

DOI10.1007/BF02936064zbMath1063.05096OpenAlexW1970271928MaRDI QIDQ1767398

Călina Ploscaru, Florin Manea

Publication date: 10 March 2005

Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02936064

zbMATH Keywords

bipartite graphassignment problembipartite matching

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms (68W40) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

An efficient approach for the rank aggregation problem

Cites Work

• Finding all the perfect matchings in bipartite graphs
• Finding all minimum-cost perfect matchings in Bipartite graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Solving a combinatorial problem with network flows