An algorithmic framework for the matching problem in some hypergraphs
Michele Conforti, Gérard Cornuéjols · Networks · 1987
Abstract The matching problem in bipartite graphs can be solved by an elegant primal‐dual algorithm. The purpose of this paper is to introduce concepts which make it possible to generalize this algorithm to some classes of hypergraphs. We illustrate the approach by providing a polynomial primal‐dual algorithm for the matching problem in hypergraphs without odd cycles.