|
gptkbp:instanceOf
|
gptkb:mathematical_concept
|
|
gptkbp:appliesTo
|
flow network
|
|
gptkbp:citation
|
gptkb:Ford,_L._R.,_and_Fulkerson,_D._R._(1956)._Maximal_flow_through_a_network._Canadian_Journal_of_Mathematics.
|
|
gptkbp:describes
|
relationship between maximum flow and minimum cut in a flow network
|
|
gptkbp:field
|
combinatorial optimization
graph theory
|
|
gptkbp:hasApplication
|
computer science
electrical engineering
logistics
operations research
telecommunications
supply chain management
|
|
https://www.w3.org/2000/01/rdf-schema#label
|
max-flow min-cut theorem
|
|
gptkbp:isFundamentalTo
|
network flow theory
|
|
gptkbp:provenBy
|
gptkb:Lester_R._Ford_Jr.
gptkb:Delbert_Fulkerson
|
|
gptkbp:relatedTo
|
gptkb:Ford–Fulkerson_algorithm
gptkb:Edmonds–Karp_algorithm
|
|
gptkbp:state
|
the maximum value of a flow is equal to the minimum capacity of a cut
|
|
gptkbp:usedIn
|
scheduling
image segmentation
network design
transportation problems
bipartite matching
|
|
gptkbp:yearProved
|
1956
|
|
gptkbp:bfsParent
|
gptkb:Cut_(graph_theory)
|
|
gptkbp:bfsLayer
|
6
|