Push–relabel maximum flow algorithm: Difference between revisions

Content deleted Content added
Line 345:
== References ==
 
* {{cite isbn/978026203293|chapter=§26.4 Push–relabel algorithms|pages=669–681}}
* [[Thomas H. Cormen]], [[Charles E. Leiserson]], [[Ronald L. Rivest]], and [[Clifford Stein]]. ''[[Introduction to Algorithms]]'', Second Edition. MIT Press and McGraw–Hill, 2001. ISBN 0-262-03293-7. Section 26.4: Push–relabel algorithms, and section 26.5: The relabel-to-front-algorithm.
 
* {{cite isbn/978026203293|chapter=§26.5 The relabel-to-front algorithm|pages=681–692}}
* [[Andrew V. Goldberg]], [[Robert E. Tarjan]]. [http://doi.acm.org/10.1145/12130.12144 A new approach to the maximum flow problem]. Annual ACM Symposium on Theory of Computing, Proceedings of the eighteenth annual ACM symposium on Theory of computing, 136–146. ISBN 0-89791-193-8, 1986
 
* {{cite doi|10.1145/12130.12144}}
 
* {{cite doi|10.1016/S0377-2217(96)00269-X}}
 
{{DEFAULTSORT:Push-relabel maximum flow algorithm}}