Sanders, Peter Algorithms and Complexity, MPI for Informatics, Max Planck Society;
Egner, Sebastian Algorithms and Complexity, MPI for Informatics, Max Planck Society;
Sanders, P., Egner, S., & Tolhuizen, L. (2003). Polynomial Time Algorithms For Network Information Flow. In Proceedings of the 15th ACM Symposium on Parallel Algorithms and Architectures (SPAA-03) (pp. 286-294). New York, USA: ACM.