Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 226,160,337 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
,
Oumarou 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
2018
2018
Approach of Multicasting Routing with Solution for Network Coding Applying Edmonds-Karp
J. Márquez
,
I. Gutiérrez
,
Elba Sánchez
IEEE International Conference on Automatica
2018
Corpus ID: 58012504
A multicast routing network is obtained from a general communications network where the source nodes and sinks are specified. We…
Expand
Review
2016
Review
2016
Highly reliable stochastic flow network reliability estimation
H. Cancela
,
Leslie Murray
,
G. Rubino
Latin American Computing Conference / Conferencia…
2016
Corpus ID: 16909823
This state of the art discusses the problem of reliability estimation for highly reliable stochastic flow networks. There are…
Expand
2015
2015
A method of computing equilibrium for the partnership formation
Junwu Zhu
,
Heng Song
,
Fang Liu
,
Guocheng Yin
International Conference on Computer Supported…
2015
Corpus ID: 2108530
In the model of partnership formation, every agent is in hot pursuit of maximizing his own utility. Doft Talman and Zaifu Yang…
Expand
2013
2013
Parallelizing Network Flow Algorithm Using Push-Relabel Method
Aditya Gaykar
,
N. Sharma
,
Abhijit Bhandarkar
,
Amroz Siddiqui
2013
Corpus ID: 212452135
.
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
1999
1999
A new scaling algorithm for the minimum cost network flow problem
D. Goldfarb
,
Zhiying Jin
Operations Research Letters
1999
Corpus ID: 42257903
1994
1994
Efficient algorithms for minimum-cost flow problems with piecewise-linear convex costs
Y. Pinto
,
R. Shamir
Algorithmica
1994
Corpus ID: 20723590
We present two efficient algorithms for the minimum-cost flow problem in which arc costs are piecewise-linear and convex. Our…
Expand
1989
1989
Peripherally specified homomorphs of knot groups
Dennis Johnson
,
C. Livingston
1989
Corpus ID: 54085170
Let G be a group and let , and A be elements of G. Necessary and sufficient conditions are presented for the solution of the…
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