'Sleator' presentation slideshows

Max flows in O(nm) time, and sometimes less. by James B. Orlin MIT Sloan School

Max flows in O(nm) time, and sometimes less. by James B. Orlin MIT Sloan School. The Maximum Flow Problem. Directed Graph G = (N, A). Source s Sink t Capacities u ij on arc ( i,j ). Let U = max { u sj : j ? N}. Maximize the flow out of s, subject to

477 views • 29 slides