Revision as of 23:12, 10 April 2014 edit Kxx (talk \| contribs) Extended confirmed users 3,386 edits →Practical implementations ← Previous edit		Revision as of 01:47, 11 April 2014 edit undo Kxx (talk \| contribs) Extended confirmed users 3,386 edits →Highest-label selection rule Next edit →
Line 117: The highest-label push-relabel algorithm<ref name="cheriyan88"/> organizes all vertices into buckets indexed by their heights. The algorithm always selects an active vertex with the largest height to discharge. The algorithm has {{nowrap\|''O''(''V''^<sup>2</sup>{{sqrt\|''E''}})}} time complexity. ===Heuristics===

Push–relabel maximum flow algorithm: Difference between revisions