CFP last date
20 January 2025
Call for Paper
February Edition
IJCA solicits high quality original research papers for the upcoming February edition of the journal. The last date of research paper submission is 20 January 2025

Submit your paper
Know more
The week's pick
Responsive image
SFLA-Based Line Balancing and Task Optimization in Master-Slave Controlled Hanger Transportation Systems for Garment Production

Duc Hoang Nguyen
Random Articles
Reseach Article

Analysis and Optimization of Max Flow Min-cut

by Nitin Mukesh Tiwari, Swatie Bansal, Abhishek Tripathi
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 79 - Number 17
Year of Publication: 2013
Authors: Nitin Mukesh Tiwari, Swatie Bansal, Abhishek Tripathi
10.5120/13963-1859

Nitin Mukesh Tiwari, Swatie Bansal, Abhishek Tripathi . Analysis and Optimization of Max Flow Min-cut. International Journal of Computer Applications. 79, 17 ( October 2013), 26-31. DOI=10.5120/13963-1859

@article{ 10.5120/13963-1859,
author = { Nitin Mukesh Tiwari, Swatie Bansal, Abhishek Tripathi },
title = { Analysis and Optimization of Max Flow Min-cut },
journal = { International Journal of Computer Applications },
issue_date = { October 2013 },
volume = { 79 },
number = { 17 },
month = { October },
year = { 2013 },
issn = { 0975-8887 },
pages = { 26-31 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume79/number17/13963-1859/ },
doi = { 10.5120/13963-1859 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T21:53:16.710267+05:30
%A Nitin Mukesh Tiwari
%A Swatie Bansal
%A Abhishek Tripathi
%T Analysis and Optimization of Max Flow Min-cut
%J International Journal of Computer Applications
%@ 0975-8887
%V 79
%N 17
%P 26-31
%D 2013
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Today we are working with the networks all around and that's why it becomes very important to find the effective flow of the commodity within that network. This paper aims to provide an analysis of the best known algorithm for calculating maximum flow of any network and to propose an approximate algorithm, which can solve the same problem with lesser complexity, desirably lesser than the complexity of the known Stoer-Wagner algorithm. This paper addresses this problem with a new approach, which uses upper bound values of each node in the network. Results are compared with fixed number of nodes and variable number of nodes in the network. Moreover networks with variable densities are also considered. Results are obtained by programming the both algorithms in C++. Unix scripts are also used for formatting the results.

References
  1. D. R. Karger, "Minimum cuts in near-linear time. " Journal of the ACM, vol. 47, 2000. .
  2. GauravAggarwal, Rajeevkumar, DineshSharma, Anshul Meena,Mausham Ghosh, "Min-Cut Tree", 2010
  3. MECHTHILD STOER, FRANK WAGNER, "A Simple Min-Cut Algorithm", 1995
  4. R. E. Gomory, T. C. Hu. "Multi-terminal network ", Journal of the Society for Industrial and Applied Mathematics, vol. 9, 1961.
  5. Schrijver, "Combinatorial Optimization. ", Springer-Verlag Berlin Heidelberg, 2003. .
  6. S. M. Sadegh, Tabatabaei Yazdi Serap A. Savari ,"A Max-Flow/Min-Cut Algorithm for a Class of Wireless Networks ".
  7. Thomas H. Cormen, Leiserson, Reivest, Stein (MIT), "Introduction to algorithms", MIT Press – 2nd Edition 2001.
  8. Yuri Boykov and Vladimir Kolmogorov, "An Experimental Comparison of Min-Cut/Max-Flow Algorithms for Energy Minimization in Vision ", 2004
  9. Steven S. Skiena, "Algorithms design Manual".
Index Terms

Computer Science
Information Sciences

Keywords

Min-cut maximum flow edge weighted graphs .

Powered by PhDFocusTM