Published February 1, 2018
| Version v1
Journal article
Restricted
A SWIFT APPROACH TO OBTAIN THE MAXIMUM FLOW IN A NETWORK FLOW PROBLEM
Description
This paper presents a swift approach for solving maximum flow problem along with numerical illustration. Comparative study among the solutions obtained by the proposed method and the other existing methods has also been carried out. Here observed that this proposed method provides the maximum flow very swiftly.
Files
Restricted
The record is publicly accessible, but files are restricted to users with access.