Revision as of 12:35, 11 April 2014 edit Kxx (talk \| contribs) Extended confirmed users 3,386 edits →Description ← Previous edit		Revision as of 12:36, 11 April 2014 edit undo Kxx (talk \| contribs) Extended confirmed users 3,386 edits m →Highest label selection rule Next edit →
Line 117: The algorithm also has {{nowrap\|''O''(''V''<sup>3</sup>)}} time complexity. ====Highest- label selection rule==== 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.

Push–relabel maximum flow algorithm: Difference between revisions