Statements (24)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:algorithm
maximum flow algorithm |
| gptkbp:alsoKnownAs |
push-relabel algorithm
|
| gptkbp:category |
network flow algorithm
|
| gptkbp:complexity |
O(V^2 E)
|
| gptkbp:describedBy |
A New Approach to the Maximum-Flow Problem (Goldberg & Tarjan, 1986)
|
| gptkbp:field |
computer science
graph theory |
| gptkbp:hasConcept |
push operation
preflow relabel operation |
| https://www.w3.org/2000/01/rdf-schema#label |
preflow-push algorithm
|
| gptkbp:improves |
gptkb:Ford-Fulkerson_algorithm
|
| gptkbp:input |
flow network
|
| gptkbp:introduced |
gptkb:Robert_E._Tarjan
gptkb:Andrew_V._Goldberg |
| gptkbp:introducedIn |
1986
|
| gptkbp:output |
maximum flow
|
| gptkbp:relatedTo |
gptkb:Edmonds-Karp_algorithm
gptkb:Dinic's_algorithm |
| gptkbp:solvedBy |
maximum flow problem
|
| gptkbp:bfsParent |
gptkb:Push-relabel_algorithm
gptkb:Lowest-label_push–relabel |
| gptkbp:bfsLayer |
7
|