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
Citácia podle Chicago (17th ed.)Iwata, Satoru, S. Thomas McCormick, a 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.
Citácia podľa MLA (8th ed.)Iwata, 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.
Upozornenie: Tieto citáce sú generované automaticky. Nemusia byť úplne správne podľa citačných pravidiel..