NETWORK FLOW ESTIMATION ALGORITHM AND MODEL

Abstract

First, augmenting path algorithms that satisfy the conservation constraints at
intermediate vertices and the second reflow push relabel algorithms that violates the
conservation constraints at the intermediate vertices resulting incoming flow more
than outgoing flow. In this paper, we study different algorithms that determine the
maximum flow in the static and dynamic networks.