Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Ford–Fulkerson algorithm

Known as: Fulkerson, Ford-Fulkerson, Ford–Fulkerson method 
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

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2013
Highly Cited
2013
This paper proposes a maximum-flow-based complex network approach for the analysis of the vulnerability of power systems. A new… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table I
Highly Cited
2004
Highly Cited
2004
Minimum cut/maximum flow algorithms on graphs have emerged as an increasingly useful tool for exactor approximate energy… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Review
2002
Review
2002
Abstract.We review two papers that are of historical interest for combinatorial optimization: an article of A.N. Tolsto&ıbreve… Expand
  • table 1
  • figure 1
  • figure 2
Highly Cited
1994
Highly Cited
1994
It was conjectured by Fulkerson that the edge-set of any bridgeless graph can be covered by six cycles (union of circuits) such… Expand
Highly Cited
1985
Highly Cited
1985
The polytopal approach of Edmonds and Fulkerson has been used with great success in the development of polynomial algorithms for… Expand
Highly Cited
1982
Highly Cited
1982
Often the optimum of a combinatorial optimization problem is characterized by a min-max relation, asserting that the maximum… Expand
Highly Cited
1982
Highly Cited
1982
A class of characteristic function games arising from maximum flow problems is introduced and is shown to coincide with the class… Expand
Highly Cited
1977
Highly Cited
1977
  • P. Seymour
  • J. Comb. Theory, Ser. B
  • 1977
  • Corpus ID: 2958682
Abstract The max-flow min-cut theorem of Ford and Fulkerson (for undirected networks) may be regarded as a statement about the… Expand
Highly Cited
1975
Highly Cited
1975
Abstract : The paper is concerned with an integer programming characterization of a cut in a network. This characterization… Expand
  • figure 1
  • figure 1
  • figure 2
Highly Cited
1962
Highly Cited
1962
In this classic book, first published in 1962, L. R. Ford, Jr., and D. R. Fulkerson set the foundation for the study of network… Expand