Statements (22)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:algorithm
gptkb:maximum_flow_algorithm |
| gptkbp:canBe |
gptkb:Edmonds–Karp_algorithm
|
| gptkbp:canFailToTerminate |
irrational capacities
|
| gptkbp:category |
network flow algorithms
|
| gptkbp:complexity |
O(max_flow * E)
|
| gptkbp:describedBy |
gptkb:Flows_in_Networks_(book)
|
| gptkbp:field |
computer science
graph theory |
| gptkbp:firstPublished |
1956
|
| gptkbp:input |
flow network
|
| gptkbp:namedAfter |
gptkb:Delbert_Fulkerson
gptkb:Lester_R._Ford,_Jr. |
| gptkbp:output |
maximum flow
|
| gptkbp:relatedTo |
gptkb:Edmonds–Karp_algorithm
gptkb:Dinic's_algorithm |
| gptkbp:solvedBy |
maximum flow problem
|
| gptkbp:uses |
augmenting paths
|
| gptkbp:bfsParent |
gptkb:Delbert_Ray_Fulkerson
gptkb:Edmonds–Karp_algorithm |
| gptkbp:bfsLayer |
5
|
| https://www.w3.org/2000/01/rdf-schema#label |
Ford–Fulkerson algorithm
|