Techniques for solving maximal flow problem

Abstract

There are several methods accessible for the solution of Maximal flow network problems. Marking technique is an option strategy for Maximal flow network problems. The fundamental thing in the marking methodology is to efficiently append names to the hubs of a network until the point that optimum solution is acquired. Labeling techniques can be utilized to fathom distinctive sorts of network problems. For example, most brief way issues, maximal flow problems, general negligible cost stream problems etc. what's more, minimal spanning tree problems. It is the motivation behind this paper to represent the general idea of the labeling algorithms by depicting a marking strategy for the Maximal- flow problem