An algorithmic framework for the matching problem in some hypergraphs

DOI10.1002/NET.3230170402MaRDI QIDQ3789371zbMATH OpenOpenAlexFDO

Authors Michele Conforti, Gérard Cornuéjols

Publication date 1987

Published in Networks (Search for Journal in Brave)

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

zbMATH Keywords

matchinghypergraphsbipartite graphsset packingpolynomial primal- dual algorithm

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Perfect matching in bipartite hypergraphs subject to a demand graph
• scientific article; zbMATH DE number 795216
• Matchings and flows in hypergraphs

Cites work

• Paths, Trees, and Flowers
• Structural properties and recognition of restricted and strongly unimodular matrices

Cited in

(10)

• A primal dual integer programming algorithm
• Matchings and flows in hypergraphs
• A geometric theory for hypergraph matching
• scientific article; zbMATH DE number 6297805 (Why is no real title available?)
• A local algorithm and its percolation analysis of bipartite z-matching problem
• Some remarks on hypergraph matching and the Füredi–Kahn–Seymour conjecture
• Perfect matching in bipartite hypergraphs subject to a demand graph
• A natural barrier in random greedy hypergraph matching
• An algorithm for matching problems of multi-partite graphs which include one cycle
• scientific article; zbMATH DE number 123780 (Why is no real title available?)

This page was built for publication: An algorithmic framework for the matching problem in some hypergraphs

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