# Show that, given a maximum flow in a network with m edges, a minimum cut of N can be computed

## Question:

Show that, given a maximum flow in a network with m edges, a minimum cut of N can be computed in O(m) time.

## This problem has been solved!

Do you need an answer to a question different from the above? Ask your question!

## Step by Step Answer:

**Related Book For**

## Algorithm Design And Applications

**ISBN:** 9781118335918

1st Edition

**Authors:** Michael T. Goodrich, Roberto Tamassia

**Question Details**

Chapter #

**16**- Network Flow and MatchingSection: Reinforcement

Problem: 7

**View Solution**

Create a free account to access the answer

**Cannot find your solution?**

Post a FREE question now and get an answer within minutes.
* Average response time.