APA (7th ed.) Citation

Derigs, U. (1988). Programming in networks and graphs: On the combinatorial background and near-equivalence of network flow and matching algorithms. Springer-Verlag.

Chicago Style (17th ed.) Citation

Derigs, Ulrich. Programming in Networks and Graphs: On the Combinatorial Background and Near-equivalence of Network Flow and Matching Algorithms. Berlin ; New York: Springer-Verlag, 1988.

MLA (9th ed.) Citation

Derigs, Ulrich. Programming in Networks and Graphs: On the Combinatorial Background and Near-equivalence of Network Flow and Matching Algorithms. Springer-Verlag, 1988.