Local algorithms for the maximum flow and minimum cut in bounded-degree networks

Endre Csóka, András Pongrácz

We show a deterministic constant-time local algorithm for constructing an approximately maximum flow and minimum fractional cut in multisource-multitarget networks with bounded deg…