1. Anderson, R., & Setubal, J. C. (1995). A parallel implementation of the push-relabel algorithm for the maximum flow problem. Journal of Parallel Distributed Computing, 29(1), 17–26.
2. Boros, E., Hammer, P. L., & Sun, X. (1991). Network flows and minimization of quadratic pseudo-Boolean functions. Tech. rep. RRR 17-1991, RUTCOR.
3. Boykov, Y., & Funka-Lea, G. (2006). Graph cuts and efficient N-D image segmentation. International Journal of Computer Vision, 70(2), 109–137.
4. Boykov, Y., & Jolly, M. P. (2001). Interactive graph cuts for optimal boundary & region segmentation of objects in N-D images. In ICCV.
5. Boykov, Y., & Kolmogorov, V. (2003). Computing geodesics and minimal surfaces via graph cuts. In ICCV.