Statements (25)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:algorithm
maximum flow algorithm |
| gptkbp:appliesTo |
directed graphs
weighted graphs |
| gptkbp:augmenting_path_selection |
shortest path (in terms of number of edges)
|
| gptkbp:basedOn |
gptkb:Ford-Fulkerson_method
|
| gptkbp:category |
network flow algorithm
|
| gptkbp:complexity |
O(VE^2)
|
| gptkbp:field |
computer science
graph theory |
| gptkbp:foundIn |
augmenting paths
|
| gptkbp:guarantees |
polynomial time complexity
|
| https://www.w3.org/2000/01/rdf-schema#label |
Edmonds-Karp algorithm
|
| gptkbp:improves |
gptkb:Ford-Fulkerson_method
|
| gptkbp:input |
flow network
|
| gptkbp:introduced |
gptkb:Richard_Karp
gptkb:Jack_Edmonds |
| gptkbp:introducedIn |
1972
|
| gptkbp:output |
maximum flow
|
| gptkbp:relatedTo |
gptkb:Push-relabel_algorithm
gptkb:Dinic's_algorithm |
| gptkbp:solvedBy |
maximum flow problem
|
| gptkbp:uses |
gptkb:breadth-first_search
|
| gptkbp:bfsParent |
gptkb:Graph_theory
|
| gptkbp:bfsLayer |
5
|