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… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
Fault-tolerance is one of the most important factors in designing networks. Failures in networks are sometimes caused by an event… (More)
  • figure 1
  • figure 3
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
2011
2011
Traffic congestion has severely affected the city's development, therefore, the research on method of traffic network bottleneck… (More)
  • table I
  • figure 4
  • figure 8
  • figure 6
  • figure 12
Is this relevant?
2011
2011
We prove a strong version of the the Max-Flow Min-Cut theorem for countable networks, namely that in every such network there… (More)
  • figure 7.1
  • figure 8.2
  • figure 8.3
  • figure 8.4
Is this relevant?
2011
2011
A symbolic approach to communication networks, where the topology of the underlying network is contained in a set of formal terms… (More)
Is this relevant?
2008
2008
We show how ’test’ vector fields may be used to give lower bounds for the Cheeger constant of a Euclidean domain (or Riemannian… (More)
Is this relevant?
2008
2008
Intrigued by the capacity of random networks, we start by pro ving a max-flow min-cut theorem that is applicable to any random… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2004
Highly Cited
2004
After [15], [31], [19], [8], [25], [5], minimum cut/maximum flow algorithms on graphs emerged as an increasingly useful tool for… (More)
Is this relevant?
Highly Cited
2000
Highly Cited
2000
We introduce a new class of problems callednetwork information flow which is inspired by computer network applications. Consider… (More)
  • figure 3
  • figure 1
  • figure 2
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1999
Highly Cited
1999
In this paper, we establish max-flow min-cut theorems for several important classes of multicommodity flow problems. In… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
1998
Highly Cited
1998
It is shown that the minimum cut ratio is within a factor of O(log k) of the maximum concurrent flow for k-commodity flow… (More)
Is this relevant?