Iwata, S., McCormick, S. T., & Shigeno, M. (2005). A Strongly Polynomial Cut Canceling Algorithm for Minimum Cost Submodular Flow. SIAM Journal on Discrete Mathematics, 19(2), 304-320. https://doi.org/10.1137/s0895480199361533
Chicago Style (17th ed.) CitationIwata, Satoru, S. Thomas McCormick, and Maiko Shigeno. "A Strongly Polynomial Cut Canceling Algorithm for Minimum Cost Submodular Flow." SIAM Journal on Discrete Mathematics 19, no. 2 (2005): 304-320. https://doi.org/10.1137/s0895480199361533.
MLA (9th ed.) CitationIwata, Satoru, et al. "A Strongly Polynomial Cut Canceling Algorithm for Minimum Cost Submodular Flow." SIAM Journal on Discrete Mathematics, vol. 19, no. 2, 2005, pp. 304-320, https://doi.org/10.1137/s0895480199361533.
Warning: These citations may not always be 100% accurate.