Skip to search formSkip to main contentSkip to account menu

Max-flow min-cut theorem

Known as: Minimal cut, Max flow in networks, Maximum flow, minimum cut theorem 
In optimization theory, the max-flow min-cut theorem states that in a flow network, the maximum amount of flow passing from the source to the sink is… 
Wikipedia (opens in a new tab)

Related topics

Related topics

28 relations
Active contour modelApproximate max-flow min-cut theoremClosure problemConnectivity (graph theory)

Broader (1)

Combinatorial optimization

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
Approximate Max-Flow Min-Cut Theorems (Course Notes Extension for COMP5703)
In this report, we discuss two approximate max-flow min-cut theorems that first introduced by Tom Leighton and Satish Rao in 1988… 
2009
2009
Max-Flow Min-Cut
Die vorliegende Arbeit ist eine Monographie uber Netzwerke. Die Theorie der Netzwerkflusse ist ein mathematisches Gebiet, das… 
2009
2009
An Improved Approach for Generating Max-Fault Min-Cardinality Diagnoses
  • 2009
  • Corpus ID: 131764290
Most approaches to model-based diagnosis focus on isolating defective component(s) by performing additional measurements on the… 
2008
2008
A Max-Flow Min-Cut Theorem with Applications in Small Worlds and Dual Radio Networks
Intrigued by the capacity of random networks, we start by proving a max-flow min-cut theorem that is applicable to any random… 
2004
2004
On Reliable Communication over Additive White Gaussian Noise Relay Channels
Upper and lower bounds on the capacity and minimum energy-per-bit for general additive white Gaussian noise (AWGN) and frequency… 
1998
1998
Max-flow Min-cut Theorem
Augmenting path theorem. Flow f is a max flow iff there are no augmenting paths. Max-flow min-cut theorem. [Ford-Fulkerson 1956… 
1992
1992
A combinatorial interior point method for network flow problems
For solving minimum cost flow problems, we develop a combinatorial interior point method based on a variant of the algorithm of… 
1990
1990
Max-flow min-cut theorem in an anisotropic network
1984
1984
Graphs with the smallest number of minimum cut sets
The number of vertex cut sets of size k in a graph of connectivity k has been used as a measure of network reliability. Let G be… 
1976
1976
An Efficient Algorithm for Reducing the Complexity of Computation in Fault Tree Analysis
This paper presents a new algorithm for efficiently generating the minimal cut-sets of a fault tree containing repetitions of…