Push–relabel maximum flow algorithm: Difference between revisions

Content deleted Content added
Definitions and notations: What is a "function real function"?
expand
Line 429:
== References ==
{{reflist|2|refs=
<ref name="clrs26">{{citeCite isbn/978026203293|chapter=§26 Maximum flow|pages=643–698}}</ref>book
| isbn = 0262032937
| title = [[Introduction to Algorithms]]
| edition = 2nd
| last1 = Cormen
| first1 = T. H.
| authorlink1 = Thomas H. Cormen
| year = 2001
| publisher = The MIT Press
| last2 = Leiserson
| first2 = C. E.
| authorlink2 = Charles E. Leiserson
| last3 = Rivest
| first3 = R. L.
| authorlink3 = Ron Rivest
| last4 = Stein
| first4 = C.
| authorlink4 = Clifford Stein
| chapter = §26 Maximum flow
| pages = 643–698
}}</ref>
<ref name="goldberg86">{{cite book|doi=10.1145/12130.12144|chapter=A new approach to the maximum flow problem|title=Proceedings of the eighteenth annual ACM symposium on Theory of computing - STOC '86|pages=136|year=1986|last1=Goldberg|first1=A V|last2=Tarjan|first2=R E|isbn=0897911938}}</ref>
<ref name="goldberg88">{{cite journal|doi=10.1145/48014.61051|title=A new approach to the maximum-flow problem|journal=Journal of the ACM|volume=35|issue=4|pages=921|year=1988|last1=Goldberg|first1=Andrew V.|last2=Tarjan|first2=Robert E.}}</ref>