Matchings and flows in hypergraphs

DOI10.17169/REFUBIUM-2157MaRDI QIDQ5123491zbMATH OpenOpenAlexFDO

Authors Isabel Beckenbach

Publication date 29 September 2020

Full work available at URL http://nbn-resolving.de/urn:nbn:de:kobv:188-refubium-24385-6

zbMATH Keywords

hypergraphmatchingsflowsnetwork simplex algorithmdirected hypergraph

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Directed graphs (digraphs), tournaments (05C20) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Flows in graphs (05C21) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• An algorithmic framework for the matching problem in some hypergraphs
• Flows on hypergraphs
• scientific article; zbMATH DE number 5691235
• Perfect matching in bipartite hypergraphs subject to a demand graph
• Hypo-matchings in directed graphs

Cited in

(6)

• Perfect \(f\)-matchings and \(f\)-factors in hypergraphs -- a combinatorial approach
• A stochastic matching model on hypergraphs
• Flows on hypergraphs
• Tutte's 3-flow conjecture and matchings in bipartite graphs
• Train rotation optimization
• An algorithmic framework for the matching problem in some hypergraphs

This page was built for publication: Matchings and flows in hypergraphs

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