Maximum cuts for a minimum flow

zbMATH Open1349.90160MaRDI QIDQ2806718FDOQ2806718

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)

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

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)

Cited In (9)

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

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)