An improved direct labeling method for the max-flow min-cut computation in large hypergraphs and applications

DOI10.1111/1475-3995.00389zbMath1031.90070OpenAlexW2012334499MaRDI QIDQ4806910

Joachim Pistorius, Michel Minoux

Publication date: 14 May 2003

Published in: International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1111/1475-3995.00389

zbMATH Keywords

optimizationhypergraphgraph theoryminimum cutmaximum flow problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

Hypernetworks in a directed hypergraph, Evaluation of a Flow-Based Hypergraph Bipartitioning Algorithm, Network Flow-Based Refinement for Multilevel Hypergraph Partitioning

Cites Work

• Modeling hypergraphs by graphs with the same mincut properties
• A new approach to the maximum-flow problem
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
• Unnamed Item
• Unnamed Item
• Unnamed Item