Take the 2-minute tour ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

How do you find the minimal cut in a network?

share|improve this question
If you give an example or some background, it'll be easier for us to answer. Do you have a particular network in mind? –  Ben Derrett Apr 27 '11 at 8:16

1 Answer 1

I refer you here. It's a pretty simple algorithm.

share|improve this answer
Or do a search for "network flow" and take your pick of the results. If you prefer hard copy, most textbooks on Discrete Mathematics will have a chapter on network flows, with a discussion of the algorithm. –  Gerry Myerson Apr 27 '11 at 13:14

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.