Matchings and Flows in Hypergraphs

DOI10.17169/refubium-2157zbMath1454.05002OpenAlexW2998085734MaRDI QIDQ5123491

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

hypergraphflowsmatchingsnetwork simplex algorithmdirected hypergraph

Mathematics Subject Classification ID

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

Related Items (1)

Train rotation optimization

This page was built for publication: Matchings and Flows in Hypergraphs