|
gptkbp:instanceOf
|
gptkb:algorithm
gptkb:Maximum_flow_algorithm
|
|
gptkbp:alsoKnownAs
|
gptkb:Preflow–push_algorithm
|
|
gptkbp:appliesTo
|
Directed graphs
Networks with capacities
|
|
gptkbp:citation
|
gptkb:A_new_approach_to_the_maximum-flow_problem_(Goldberg_&_Tarjan,_1986)
|
|
gptkbp:contrastsWith
|
gptkb:Ford–Fulkerson_algorithm
gptkb:Edmonds–Karp_algorithm
|
|
gptkbp:field
|
gptkb:Graph_theory
Computer science
|
|
gptkbp:hasVariant
|
gptkb:FIFO_push–relabel
gptkb:Highest-label_push–relabel
gptkb:Lowest-label_push–relabel
|
|
gptkbp:introduced
|
gptkb:Robert_E._Tarjan
gptkb:Andrew_V._Goldberg
|
|
gptkbp:introducedIn
|
1986
|
|
gptkbp:solvedBy
|
gptkb:Maximum_flow_problem
|
|
gptkbp:usesDataStructure
|
Height function
Preflow
|
|
gptkbp:usesOperation
|
Push
Relabel
|
|
gptkbp:worstCaseTimeComplexity
|
O(V^2 E)
|
|
gptkbp:bfsParent
|
gptkb:Edmonds–Karp_algorithm
|
|
gptkbp:bfsLayer
|
5
|
|
https://www.w3.org/2000/01/rdf-schema#label
|
Push–relabel algorithm
|