PPT-A Simple Min-Cut Algorithm
Joseph Vessella RutgersCamden 1 The Problem Input Undirected graph G V E Edges have nonnegative weights Output A minimum cut of G 2 Cut Example Weight of this cut
Download Presentation
"A Simple Min-Cut Algorithm" is the property of its rightful owner. Permission is granted to download and print materials on this website for personal, non-commercial use only, provided you retain all copyright notices. By downloading content from our website, you accept the terms of this agreement.
Presentation Transcript
Transcript not available.