---
title: "Bibliography"
canonical: "https://docs.magma-maths.org/Combinatorics/Networks/bibliography.html"
source: "https://docs.magma-maths.org/Combinatorics/Networks/bibliography.md"
part: "Combinatorics"
chapter: "Networks"
breadcrumbs:
  - {"title": "Magma Handbook", "source": "../../index.md"}
  - {"title": "Combinatorics", "source": "../index-combinatorics.md"}
  - {"title": "Networks", "source": "index-networks.md"}
prev: {"title": "Maximum Flow and Minimum Cut", "source": "flow.md"}
next: {"title": "Coding Theory", "source": "../../CodingTheory/index-coding-theory.md"}
---

# Bibliography

<a id="cite-amo"></a>
- **[AMO93]** R.K. Ahuja, T.L. Magnanti, and J.B. Orlin. *Network Flows, Theory, Algorithms, and Applications*. Prentice Hall, 1993.
<a id="cite-goldberg-flow"></a>
- **[CG97]** B.V. Cherkassky and A.V. Golberg. On Implementing the Push-Relabel Method for the Maximum Flow Problem. *Algorithmica*, 19:390–410, 1997.
<a id="cite-goldberg-unit"></a>
- **[CGM+98]** B.V. Cherkassky, A.V. Golberg, Paul Martin, J.C. Setubal, and J. Stolfi. Augment or Push? A Computational Study of Bipartite Matching and Unit Capacity Flow Algorithms. Technical Report, NEC Research Institute, 1998.
<a id="cite-even"></a>
- **[Eve79]** Shimon Even. *Graph Algorithms*. Computer Science Press, 1979.