Keywords

#approximate_max-flow_min-cut_theorem

Approximate max-flow min-cut theorem

Mathematical propositions in network flow theory

Approximate max-flow min-cut theorems are mathematical propositions in network flow theory. Approximate max-flow min-cut theorems 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.

Thu 4th

Provided by Wikipedia

Learn More

This keyword could refer to multiple things. Here are some suggestions:

Max-flow min-cut theorem Approximate max-flow min-cut theorem Maximum flow problem Kőnig's theorem (graph theory) Ford–Fulkerson algorithm Network flow problem Cut (graph theory) Graph cuts in computer vision Karger's algorithm Duality (optimization)
0 searches
This keyword has never been searched before
This keyword has never been searched for with any other keyword.