|
gptkbp:instanceOf
|
gptkb:algorithm
Maximum flow algorithm
Graph algorithm
|
|
gptkbp:augmentingPathSelection
|
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
|
gptkb:Graph_Theory
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_method
|
|
gptkbp:input
|
Directed graph
Edge capacities
Sink node
Source node
|
|
gptkbp:introduced
|
gptkb:Richard_Karp
gptkb:Jack_Edmonds
|
|
gptkbp:introducedIn
|
1972
|
|
gptkbp:namedAfter
|
gptkb:Richard_Karp
gptkb:Jack_Edmonds
|
|
gptkbp:output
|
Maximum flow value
|
|
gptkbp:relatedTo
|
gptkb:Push-relabel_algorithm
gptkb:Dinic's_algorithm
|
|
gptkbp:solvedBy
|
gptkb:Maximum_flow_problem
|
|
gptkbp:usedIn
|
Network design
Bipartite matching
Transportation networks
|
|
gptkbp:uses
|
gptkb:Breadth-first_search
|
|
gptkbp:bfsParent
|
gptkb:Graph_Algorithms
|
|
gptkbp:bfsLayer
|
6
|