# Ford–Fulkerson algorithm

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2015

2015

- Brazilian Symposium on Computing Systems…
- 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)

Is this relevant?

2014

2014

- International Carnahan Conference on Security…
- 2014

This paper discusses a face image abstraction method by using SIFT features and Ford-Fulkerson algorithm. Ford-Fulkerson… (More)

Is this relevant?

2013

2013

- 2013

The maximum flow problem is one of the most fundamental problems in network flow theory and has been investigated extensively… (More)

Is this relevant?

2012

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)

Is this relevant?

2007

2007

- 2007

This work presents an algorithm for computing the maximum flow and minimum cut of undirected graphs, based on the well-known… (More)

Is this relevant?

Highly Cited

2004

Highly Cited

2004

- IEEE Trans. Pattern Anal. Mach. Intell.
- 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

- 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

- 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)

Is this relevant?

Highly Cited

1977

Highly Cited

1977

- IEEE Transactions on Software Engineering
- 1977

In a distributed computing system a modular program must have its modules assigned among the processors so as to avoid excessive… (More)

Is this relevant?

Highly Cited

1972

Highly Cited

1972

- J. ACM
- 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)

Is this relevant?