Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 228,397,759 papers from all fields of science
Search
Sign In
Create Free Account
Max-flow min-cut theorem
Known as:
Minimal cut
, Max flow in networks
, Maximum flow, minimum cut theorem
Expand
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
28 relations
Active contour model
Approximate max-flow min-cut theorem
Closure problem
Connectivity (graph theory)
Expand
Broader (1)
Combinatorial optimization
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Directed Fuzzy Networks as a Model to Illicit Flows and Max Flow Min Cut Theorem
S. Mathew
,
J. Mordeson
New Mathematics and Natural Computation
2017
Corpus ID: 125706921
Directed fuzzy networks are introduced in this paper. They are normalized node capacitated networks and provide a good platform…
Expand
2014
2014
Approximate Max-Flow Min-Cut Theorems (Course Notes Extension for COMP5703)
Shanshan Wang
2014
Corpus ID: 16333675
In this report, we discuss two approximate max-flow min-cut theorems that first introduced by Tom Leighton and Satish Rao in 1988…
Expand
2011
2011
Research on Method of Traffic Network Bottleneck Identification based on Max-flow Min-cut Theorem
Shengwu Dong
,
Yi Zhang
International Conference on Transportation…
2011
Corpus ID: 22869676
Traffic congestion has severely affected the city's development, therefore, the research on method of traffic network bottleneck…
Expand
2011
2011
A Max-Flow/Min-Cut Algorithm for Linear Deterministic Relay Networks
S. M. T. Yazdi
,
S. Savari
IEEE Transactions on Information Theory
2011
Corpus ID: 6315936
The linear deterministic model of relay networks (LDRN) is a generalization of the traditional directed network model which has…
Expand
2010
2010
A max-flow/min-cut algorithm for a class of wireless networks
S. M. Sadegh
,
Tabatabaei Yazdi
,
S. Savari
ACM-SIAM Symposium on Discrete Algorithms
2010
Corpus ID: 15682801
The linear deterministic model of relay channels is a generalization of the traditional directed network model which has become…
Expand
2009
2009
Max-Flow Min-Cut
Timon Heiko Thalwitzer
2009
Corpus ID: 86534091
Die vorliegende Arbeit ist eine Monographie uber Netzwerke. Die Theorie der Netzwerkflusse ist ein mathematisches Gebiet, das…
Expand
Highly Cited
2005
Highly Cited
2005
Amplify-forward and decode-forward: the impact of location and capacity contour
Meng Yu
,
Jing Li
,
H. Sadjadpour
IEEE Military Communications Conference
2005
Corpus ID: 12251200
Successful message relay, or the quality of the inter-user channel, is critical to fully realize the cooperative benefits…
Expand
1998
1998
Max-flow Min-cut Theorem
T. Cormen
,
C. Leiserson
,
R. Rivest
1998
Corpus ID: 118461176
Augmenting path theorem. Flow f is a max flow iff there are no augmenting paths. Max-flow min-cut theorem. [Ford-Fulkerson 1956…
Expand
Review
1994
Review
1994
Examples of max-flow and min-cut problems with duality gaps in continuous networks
R. Nozawa
Mathematical programming
1994
Corpus ID: 25479049
Strang (Mathematical Programming 26, 1983) gave a method to establish a max-flow min-cut theorem in a domain of a Euclidean space…
Expand
Highly Cited
1991
Highly Cited
1991
CAREL: Computer Aided Reliability Evaluator for Distributed Computing Networks
S. Soh
,
S. Rai
IEEE Trans. Parallel Distributed Syst.
1991
Corpus ID: 1132635
An efficient method to compute the terminal reliability (the probability of communication between a pair of nodes) of a…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE