|
gptkbp:instanceOf
|
gptkb:algorithm
graph
maximum flow algorithm
|
|
gptkbp:appliesTo
|
directed graphs
weighted graphs
|
|
gptkbp:augmentingPathSelection
|
shortest path (in terms of number of edges)
|
|
gptkbp:basedOn
|
gptkb:Ford–Fulkerson_algorithm
|
|
gptkbp:category
|
network flow algorithm
|
|
gptkbp:complexity
|
O(VE^2)
|
|
gptkbp:field
|
computer science
|
|
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_algorithm
|
|
gptkbp:input
|
flow network
|
|
gptkbp:introduced
|
gptkb:Richard_Karp
gptkb:Jack_Edmonds
|
|
gptkbp:introducedIn
|
1972
|
|
gptkbp:namedAfter
|
gptkb:Richard_Karp
gptkb:Jack_Edmonds
|
|
gptkbp:output
|
maximum flow
|
|
gptkbp:relatedTo
|
gptkb:Push–relabel_algorithm
gptkb:Dinic's_algorithm
|
|
gptkbp:solvedBy
|
maximum flow problem
|
|
gptkbp:usedIn
|
network design
transportation networks
bipartite matching
|
|
gptkbp:uses
|
gptkb:breadth-first_search
|
|
gptkbp:bfsParent
|
gptkb:Richard_M._Karp
|
|
gptkbp:bfsLayer
|
4
|