Statements (19)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:algorithm
gptkb:Maximum_flow_algorithm |
| gptkbp:author |
gptkb:Robert_E._Tarjan
gptkb:Andrew_V._Goldberg |
| gptkbp:basedOn |
gptkb:Push–relabel_algorithm
|
| gptkbp:complexity |
O(n^2 sqrt(m))
|
| gptkbp:distinctiveFeature |
Selection of active vertex with highest label
|
| gptkbp:field |
gptkb:Graph_theory
Computer science |
| gptkbp:introducedIn |
1990s
|
| gptkbp:relatedTo |
gptkb:Edmonds–Karp_algorithm
gptkb:Dinic's_algorithm Goldberg–Tarjan algorithm |
| gptkbp:solvedBy |
gptkb:Maximum_flow_problem
|
| gptkbp:uses |
Labeling of vertices
Preflow-push method |
| gptkbp:bfsParent |
gptkb:Push–relabel_algorithm
|
| gptkbp:bfsLayer |
6
|
| https://www.w3.org/2000/01/rdf-schema#label |
Highest-label push–relabel
|