Statements (21)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:algorithm
|
| gptkbp:alsoKnownAs |
gptkb:Ford-Fulkerson_method
|
| gptkbp:assumes |
finite capacities
|
| gptkbp:canBeNonTerminating |
if capacities are irrational
|
| gptkbp:category |
network flow algorithm
|
| gptkbp:complexity |
O(max_flow * E)
|
| gptkbp:field |
computer science
graph theory |
| https://www.w3.org/2000/01/rdf-schema#label |
Ford-Fulkerson Algorithm
|
| gptkbp:input |
flow network
|
| gptkbp:introduced |
gptkb:Lester_R._Ford_Jr.
gptkb:Delbert_Fulkerson |
| gptkbp:introducedIn |
1956
|
| gptkbp:output |
maximum flow
|
| gptkbp:relatedTo |
gptkb:Edmonds-Karp_algorithm
gptkb:Dinic's_algorithm |
| gptkbp:solvedBy |
maximum flow problem
|
| gptkbp:uses |
augmenting path
residual graph |
| gptkbp:bfsParent |
gptkb:Graph_Algorithms
|
| gptkbp:bfsLayer |
6
|