Unformatted text preview: ( s,x i ) of capacity 2 , ( x i ,z j ) of capacity 1 whenever c j ∈ S i and edges ( z j ,t ) of capacity k . We then test whether the maximum s-t ﬂow has value nk . Running time. The Ford-Fulkerson algorithm to ﬁnd a maximum ﬂow has running time O ( | E | C ) where | E | is the number of edges and C is the total capacity of edges out of s . Here, we have | E | = O ( mn ) and C = 2 m , so the running time is O ( m 2 n ) ....
View Full Document
This note was uploaded on 05/22/2010 for the course CS 316 taught by Professor Stevenku during the Spring '10 term at Universidad San Martín de Porres.
- Spring '10