Statements (19)
Predicate | Object |
---|---|
gptkbp:instanceOf |
gptkb:algorithm
|
gptkbp:canBe |
non-polynomial time complexity with irrational capacities
|
gptkbp:category |
graph algorithms
|
gptkbp:complexity |
depends on path-finding method
|
gptkbp:field |
gptkb:mathematics
computer science |
gptkbp:heldBy |
greedy algorithm
|
https://www.w3.org/2000/01/rdf-schema#label |
Ford-Fulkerson method
|
gptkbp:input |
flow network
|
gptkbp:introduced |
1956
|
gptkbp:namedAfter |
gptkb:Delbert_Fulkerson
gptkb:Lester_R._Ford,_Jr. |
gptkbp:output |
maximum flow
|
gptkbp:relatedTo |
gptkb:Edmonds-Karp_algorithm
|
gptkbp:usedFor |
computing maximum flow in a flow network
|
gptkbp:uses |
augmenting paths
|
gptkbp:bfsParent |
gptkb:Edmonds-Karp_algorithm
gptkb:Ford-Fulkerson_algorithm |
gptkbp:bfsLayer |
6
|