Maximum cuts for a minimum flow

MaRDI QIDQ2806718zbMATH OpenFDO

Authors Eleonor Ciurea

Publication date 18 May 2016

Published in Bulletin of the Transilvania University of Brașov. Series III. Mathematics, Informatics, Physics (Search for Journal in Brave)

zbMATH Keywords

network flowmaximum cutminimum flow

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph theory (including graph drawing) in computer science (68R10) Deterministic network models in operations research (90B10) Extremal problems in graph theory (05C35)

Recommendations

• Maximum flows and minimum cuts in the plane
• Maximum flows and minimum cuts in the plane
• Maximum concurrent flows and minimum cuts
• scientific article; zbMATH DE number 2190137
• Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
• Minimum flow variation in maximum flows
• Inverse maximum flow and minimum cut problems
• The maximum cut problem
• A measure-theoretical max-flow-min-cut problem

Cited in

(9)

• Families of cuts with the MFMC-property
• Maximum concurrent flows and minimum cuts
• Exact cuts in networks
• A new approach for computing a most positive cut using the minimum flow algorithms
• scientific article; zbMATH DE number 32325 (Why is no real title available?)
• Rapidly Solving an Online Sequence of Maximum Flow Problems with Extensions to Computing Robust Minimum Cuts
• Some Network Flow Problems Solved with Pseudo-Boolean Programming
• On node constraint networks
• Invariant sets of arcs in network flow problems

This page was built for publication: Maximum cuts for a minimum flow

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