Theorem 3.4 — if the algorithm terminates with finite labels, the preflow is a maximum flow

Initializing...

Theorem 3.4 — if the algorithm terminates with finite labels, the preflow is a maximum flow · Prove2Me