Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 226,160,382 papers from all fields of science
Search
Sign In
Create Free Account
Ford–Fulkerson algorithm
Known as:
Fulkerson
, Ford-Fulkerson
, Ford–Fulkerson method
Expand
The Ford–Fulkerson method or Ford–Fulkerson algorithm (FFA) is a greedy algorithm that computes the maximum flow in a flow network. It is called a…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
22 relations
Approximate max-flow min-cut theorem
Breadth-first search
Depth-first search
Dinic's algorithm
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Flows over time and submodular function minimization
Miriam Schlöter
2018
Corpus ID: 126088536
2018
2018
FPGA Interconnect Resources Test Based on A Improved Ford-Fulkerson Algorithm
Ruipeng Bai
,
Hui Guo
,
Zhenzhong Wang
,
Yanlong Zhang
,
Fan Zhang
,
Lei Chen
IEEE 4th Information Technology and Mechatronics…
2018
Corpus ID: 195224957
Interconnect resource(IR) test is one of the most crucial parts in Field Programmable Gate Arrays(FPGA ) test. The Ford-Fulkerson…
Expand
2016
2016
Structural sparseness and complex networks
F. Reidl
2016
Corpus ID: 39368113
The field of complex networks has seen a steady growth in the last decade, fuelled by an ever-growing collection of relational…
Expand
2016
2016
Maximum Likelihood Analysis of the Ford–Fulkerson Method on Special Graphs
Ulrich Laube
,
M. Nebel
Algorithmica
2016
Corpus ID: 18938400
We present original average-case results on the performance of the Ford–Fulkerson maxflow algorithm on grid graphs (sparse) and…
Expand
2012
2012
Simulation of the Ford-Fulkerson Algorithm Using OMNET++
Paula Sevastian
,
A. B. Rus
,
V. Dobrota
2012
Corpus ID: 55986482
This paper presents a contribution to the OMNeT++ 4.1 simulator in C++ by integrating our own implementation of the FF Ford…
Expand
2010
2010
Edge- and Node-Disjoint Paths in P Systems
M. Dinneen
,
Yun-Bum Kim
,
Radu Nicolescu
MeCBIC
2010
Corpus ID: 13055000
In this paper, we continue our development of algorithms used for topological network discovery. We present native P system…
Expand
Review
2008
Review
2008
The use of sparsest cuts to reveal the hierarchical community structure of social networks
Charles F. Mann
,
D. Matula
,
E. Olinick
Soc. Networks
2008
Corpus ID: 10368992
Review
2005
Review
2005
Optimization in telecommunication networks
Stan van Hoesel
2005
Corpus ID: 27030468
Network design and network synthesis have been the classical optimization problems in telecommunication for a long time. In the…
Expand
2004
2004
Flow graphs - a new paradigm for data mining and knowledge discovery
Z. Pawlak
2004
Corpus ID: 890040
W: JAIST Forum 2004 - Technology Creation Based on Knowledge Science: Theory and Practice, jointly with KSS2004: 5th…
Expand
Highly Cited
2003
Highly Cited
2003
Probability, Truth and Flow Graph
Z. Pawlak
RSKD
2003
Corpus ID: 42246716
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