3 ms·

It is used for calculate the maximum flow of a flow network. https://en.wikipedia.org/wiki/Max-flow_min-cut_theorem#Application https://en.wikipedia.org/wiki/Ma

• PartiallyTyped 6y ago
  The max flow is the prime to the min-cut. But you don't use min-cut to find the max flow.
  • vmladenov 6y ago
    I don’t understand the distinction you’re drawing. Can you explain? Max flow and min cut are entirely dual. Which one you use is more a matter of convenience
    • PartiallyTyped 6y ago
      What I meant was that if you wish to find the maximum flow, you'd use push-relabel or another max-flow algorithm instead of finding the min-cut first and then building the max-flow solution from there.
• stiar 6y ago
  Well if you have designated source (s) and sink (t) in a directed network, then yes, finding max s-t flow and min s-t cut are dual problems. Here the paper seems to be dealing with undirected graphs and all cuts in them, not necessarily between a given pair of vertices, so it is slightly different.