Journal IJCRT UGC-CARE, UGCCARE( ISSN: 2320-2882 ) | UGC Approved Journal | UGC Journal | UGC CARE Journal | UGC-CARE list, New UGC-CARE Reference List, UGC CARE Journals, International Peer Reviewed Journal and Refereed Journal, ugc approved journal, UGC CARE, UGC CARE list, UGC CARE list of Journal, UGCCARE, care journal list, UGC-CARE list, New UGC-CARE Reference List, New ugc care journal list, Research Journal, Research Journal Publication, Research Paper, Low cost research journal, Free of cost paper publication in Research Journal, High impact factor journal, Journal, Research paper journal, UGC CARE journal, UGC CARE Journals, ugc care list of journal, ugc approved list, ugc approved list of journal, Follow ugc approved journal, UGC CARE Journal, ugc approved list of journal, ugc care journal, UGC CARE list, UGC-CARE, care journal, UGC-CARE list, Journal publication, ISSN approved, Research journal, research paper, research paper publication, research journal publication, high impact factor, free publication, index journal, publish paper, publish Research paper, low cost publication, ugc approved journal, UGC CARE, ugc approved list of journal, ugc care journal, UGC CARE list, UGCCARE, care journal, UGC-CARE list, New UGC-CARE Reference List, UGC CARE Journals, ugc care list of journal, ugc care list 2020, ugc care approved journal, ugc care list 2020, new ugc approved journal in 2020, ugc care list 2021, ugc approved journal in 2021, Scopus, web of Science.
How start New Journal & software Book & Thesis Publications
Submit Your Paper
Login to Author Home
Communication Guidelines

WhatsApp Contact
Click Here

  Published Paper Details:

  Paper Title

A NEW APPROACH TO MAXIMUM FLOW OF MIN CUT THEOREM BY PROPOSED ALGORITHM

  Authors

  Krithika.S,  Narmatha.S,  Murali Dharan.K

  Keywords

The maximum number of flows that can be sent from the source to the sink is addressed in Maximum Flow Problem. The algorithm for Edmonds-Karp is a modified version of the algorithm for Ford-Fulkerson. The solution to this has also been demonstrated by the use of the proposed method to justify the utility of the approach proposed. Since certain parts of its protocol are left unspecified, Ford-Fulkerson is often called a process. On the other hand, Edmonds-Karp offers complete specifications. Most

  Abstract


The maximum number of flows that can be sent from the source to the sink is addressed in Maximum Flow Problem. The algorithm for Edmonds-Karp is a modified version of the algorithm for Ford-Fulkerson. The solution to this has also been demonstrated by the use of the proposed method to justify the utility of the approach proposed. Since certain parts of its protocol are left unspecified, Ford-Fulkerson is often called a process. On the other hand, Edmonds-Karp offers complete specifications. Most notably, it states that during the intermediate phases of the programme, breadth-first search should be used to find the shortest paths. Like Ford-Fulkerson, Edmonds-Karp also deals with max- flow min - cut problems. The maximum flow in Edmonds-Karp algorithm is a highly polynomial time algorithm. This algorithm uses BFS to find augmenting paths.

  IJCRT's Publication Details

  Unique Identification Number - IJCRT2012269

  Paper ID - 201758

  Page Number(s) - 2538-2546

  Pubished in - Volume 8 | Issue 12 | December 2020

  DOI (Digital Object Identifier) -   

  Publisher Name - IJCRT | www.ijcrt.org | ISSN : 2320-2882

  E-ISSN Number - 2320-2882

  Cite this article

  Krithika.S,  Narmatha.S,  Murali Dharan.K ,   "A NEW APPROACH TO MAXIMUM FLOW OF MIN CUT THEOREM BY PROPOSED ALGORITHM", International Journal of Creative Research Thoughts (IJCRT), ISSN:2320-2882, Volume.8, Issue 12, pp.2538-2546, December 2020, Available at :http://www.ijcrt.org/papers/IJCRT2012269.pdf

  Share this article

  Article Preview

  Indexing Partners

indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
Call For Paper May 2024
Indexing Partner
ISSN and 7.97 Impact Factor Details


ISSN
ISSN
ISSN: 2320-2882
Impact Factor: 7.97 and ISSN APPROVED
Journal Starting Year (ESTD) : 2013
ISSN
ISSN and 7.97 Impact Factor Details


ISSN
ISSN
ISSN: 2320-2882
Impact Factor: 7.97 and ISSN APPROVED
Journal Starting Year (ESTD) : 2013
ISSN
DOI Details

Providing A Free digital object identifier by DOI.one How to get DOI?
For Reviewer /Referral (RMS) Earn 500 per paper
Our Social Link
Open Access
This material is Open Knowledge
This material is Open Data
This material is Open Content
Indexing Partner

Scholarly open access journals, Peer-reviewed, and Refereed Journals, Impact factor 7.97 (Calculate by google scholar and Semantic Scholar | AI-Powered Research Tool) , Multidisciplinary, Monthly, Indexing in all major database & Metadata, Citation Generator, Digital Object Identifier(DOI)

indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer