A SWIFT APPROACH TO OBTAIN THE MAXIMUM FLOW IN A NETWORK FLOW PROBLEM

DASH, PROTIMA (2018) A SWIFT APPROACH TO OBTAIN THE MAXIMUM FLOW IN A NETWORK FLOW PROBLEM. Asian Journal of Current Research (2): 3. pp. 114-121.

Full text not available from this repository.

Abstract

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.

Item Type: Article
Subjects: Asian STM > Multidisciplinary
Depositing User: Managing Editor
Date Deposited: 09 Jan 2024 08:55
Last Modified: 09 Jan 2024 08:55
URI: http://journal.send2sub.com/id/eprint/2917

Actions (login required)

View Item
View Item