S. Shine

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
A min-cut that seperates vertices s and t in a network is an edge set of minimum weight whose removal will disconnect s and t. This problem is the dual of the well known s − t max-flow problem. Several algorithms for the min-cut problem are based on max-flow computation although the fastest known min-cut algorithms are not flow based. The well known(More)
  • 1