Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 233,715,798 papers from all fields of science
Search
Sign In
Create Free Account
Edmonds–Karp algorithm
Known as:
Edmonds-Karp
, Edmonds–Karp
, Edmonds karp
Expand
In computer science, the Edmonds–Karp algorithm is an implementation of the Ford–Fulkerson method for computing the maximum flow in a flow network in…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
13 relations
Breadth-first search
Computer science
Cut (graph theory)
Dinic's algorithm
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
Modeling the Parallelization of the Edmonds-Karp Algorithm and Application
A. Chaibou
,
Ousmane Moussa Tessa
,
O. Sié
Computer and Information Science
2019
Corpus ID: 199379879
Many optimization problems can be reduced to the maximum flow problem in a network. However, the maximum flow problem is…
Expand
Review
2016
Review
2016
Review of: Lithic Analysis and Later British Prehistoy: Some Problems and Approaches, by A.G. Broen and M.E. Edmonds (Eds)
A. Saville
2016
Corpus ID: 164721100
2016
2016
Implementing MapReduce Based Edmonds-Karp Algorithm to Determine Maximum Flow in Small Network Graph
Amandeep Kour
2016
Corpus ID: 63820517
2013
2013
Parallelizing Network Flow Algorithm Using Push-Relabel Method
Aditya Gaykar
,
N. Sharma
,
Abhijit Bhandarkar
,
Amroz Siddiqui
2013
Corpus ID: 212452135
.
2013
2013
CSCI 5454 Ramdomized Min Cut
Sean Wiese
,
Ramya Nair
2013
Corpus ID: 125490298
A classic problem in computer science is finding the minimum cut of an undirected graph. If we are presented with a graph, such…
Expand
2013
2013
Parallelizing Network Flow Using ε-relaxation Algorithm
Kalpesh Adhatrao
,
Abhishek Aswar
,
A. Iyer
,
Amroz Siddiqui
2013
Corpus ID: 16653007
Maximum flow problem is a fundamental network flow problem which involves finding a feasible and optimal flow in network…
Expand
2010
2010
Eksplorasi kerja algoritma Edmonds Karp dalam menyelesaikan maximum flow problem / Ardanu Pratama Putra
Ardanu Pratama Putra
2010
Corpus ID: 62464868
Distribusi merupakan suatu proses pengiriman barang atau jasa dari produsen (depot) ke konsumen (customer)" Pada umumnya proses…
Expand
2006
2006
Towards ) Finding Suitable Analysis Techniques for Agent-based Networks Generated from Social Processes
S. Jamal
2006
Corpus ID: 4663411
HIV/AIDS has long been understood as the major obstacle in human development, especially in the poorest regions such as the sub…
Expand
2001
2001
Döntéselőkészítés az Edmonds-Karp-algoritmussal
Lőrinczi Ferenc
2001
Corpus ID: 125266520
1983
1983
A polynomial-time parametric simplex algorithm for the minimum cost network flow problem
Orlin James B.
1983
Corpus ID: 14512805
In this paper we consider the minimum cost network flow problem: min(cx : Ax = b, x 0), where A is an m x n vertex-edge incidence…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE