Statements (13)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:algorithm
|
| gptkbp:complexity |
O(n^2√m)
|
| gptkbp:field |
computer science
graph theory |
| gptkbp:proposedBy |
gptkb:Robert_E._Tarjan
gptkb:Andrew_V._Goldberg |
| gptkbp:relatedTo |
gptkb:preflow-push_algorithm
network flow |
| gptkbp:subclassOf |
push–relabel algorithm
|
| gptkbp:usedFor |
maximum flow problem
|
| gptkbp:bfsParent |
gptkb:Push–relabel_algorithm
|
| gptkbp:bfsLayer |
6
|
| https://www.w3.org/2000/01/rdf-schema#label |
Lowest-label push–relabel
|