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… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Ford-Fulkerson algorithm is widely used to solve maximum Graph-Flow problems and it can be applied to a range of different areas… (More)
  • figure 2
  • figure 1
  • figure 4
  • figure 5
  • figure 3
Is this relevant?
2014
2014
This paper discusses a face image abstraction method by using SIFT features and Ford-Fulkerson algorithm. Ford-Fulkerson… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2013
2013
The maximum flow problem is one of the most fundamental problems in network flow theory and has been investigated extensively… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2012
2012
This paper presents a contribution to the OMNeT++ 4.1 simulator in C++ by integrating our own implementation of the FF Ford… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 6
Is this relevant?
2007
2007
  • Schroeder André Pires Guedes Elias P. Duarte
  • 2007
This work presents an algorithm for computing the maximum flow and minimum cut of undirected graphs, based on the well-known… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2004
Highly Cited
2004
After [15], [31], [19], [8], [25], [5], minimum cut/maximum flow algorithms on graphs emerged as an increasingly useful tool for… (More)
Is this relevant?
1998
1998
The Ford-Fulkerson max ow labeling algorithm[3, 4] was introduced in the mid-1950's, and became the seminal work that is still… (More)
Is this relevant?
Highly Cited
1979
Highly Cited
1979
  • By P. D. SEYMOUR
  • 1979
1. Introduction It is well known that the Petersen graph is not 3-edge-colourable; that is, if we regard its 1-factors as (0, l… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
1977
Highly Cited
1977
In a distributed computing system a modular program must have its modules assigned among the processors so as to avoid excessive… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1972
Highly Cited
1972
This paper presents new algori thms for the maximum flow problem, the Hitchcock t r anspo r t a t i on problem, and the general… (More)
  • figure 1
Is this relevant?