Course Content

Other Courses

Tribhuvan university > CSIT - 2065 Syllabus > Discrete Structure > Old Questions > 2070

Discrete Structure - Old Questions

Syllabus Notes Old Questions Unit Wise Questions Question Bank

20. Define maximal flow and minimal cut and state and prove min-cut max-flow theorem.

OR

Find a maximal flow for the network shown in the figure below:


8 marks | Asked in 2070