algorithm - 3 max flow prove or disprove small questions -


the questions :

enter image description here

for (a) seems not true, can fin example of flow growing without e being saturated.

for (b) seems true, yet not sure how prove it. maybe because of min cut max flow theorm, on min cut had grew.

for (c) seems false. flow grew because e changed e might have not grew 5.

(1) seems true me - if managed increase maximum flow, means found new path source sink (that did not exist before increasing edge e). e must in new path, if e not saturated before, path have existed in original graph.

(2) false. take graph this:

s --20-- n --20-- t 

where s source , t sink, there 2 min-cuts ({(s, n)} , {(n, t)}), increasing either (s, n) or (n, t) won't change maximum flow.

(3) false. take graph this:

s --20-- n --25-- t 

if increase capacit of e = (s, n) 10, new maximum flow 25, did not increase value of e 5.


Comments

Popular posts from this blog

ruby - Trying to change last to "x"s to 23 -

jquery - Clone last and append item to closest class -

c - Unrecognised emulation mode: elf_i386 on MinGW32 -