Approximate max-flow min-cut theorem
http://dbpedia.org/resource/Approximate_max-flow_min-cut_theorem an entity of type: Thing
Approximate max-flow min-cut theorems are mathematical propositions in network flow theory. They deal with the relationship between maximum flow rate ("max-flow") and minimum cut ("min-cut") in a multi-commodity flow problem. The theorems have enabled the development of approximation algorithms for use in graph partition and related problems.
rdf:langString
rdf:langString
Approximate max-flow min-cut theorem
xsd:integer
44528136
xsd:integer
1032192553
rdf:langString
Approximate max-flow min-cut theorems are mathematical propositions in network flow theory. They deal with the relationship between maximum flow rate ("max-flow") and minimum cut ("min-cut") in a multi-commodity flow problem. The theorems have enabled the development of approximation algorithms for use in graph partition and related problems.
xsd:nonNegativeInteger
14526