Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

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… 
Highly Cited
2008
Highly Cited
2008
  • M. Skutella
  • Bonn Workshop of Combinatorial Optimization
  • 2008
  • Corpus ID: 16193955
We give an introduction into the fascinating area of flows over time—also called “dynamic flows” in the literature. Starting from… 
Review
2002
Review
2002
Abstract.We review two papers that are of historical interest for combinatorial optimization: an article of A.N. Tolsto&ıbreve… 
Highly Cited
2001
Highly Cited
2001
This paper presents new algorithms for the maximum flow problem, the Hitchcock transportation problem and the general minimum… 
Highly Cited
1994
Highly Cited
1994
  • G. FanA. Raspaud
  • Journal of combinatorial theory. Series B (Print)
  • 1994
  • Corpus ID: 43266371
It was conjectured by Fulkerson that the edge-set of any bridgeless graph can be covered by six cycles (union of circuits) such… 
Highly Cited
1985
Highly Cited
1985
Abstract We show that recognizing the facets of the traveling salesman problem polytope is Dp-complete. 
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… 
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… 
Highly Cited
1977
Highly Cited
1977
  • P. Seymour
  • Journal of combinatorial theory. Series B (Print)
  • 1977
  • Corpus ID: 2958682
1977
1977
  • A. Tucker
  • Math. Oper. Res.
  • 1977
  • Corpus ID: 207234841
This note fills a gap in the theory of convergence of the Ford-Futkerson flow algorithm. We show that if the nodes labeled by the…