CALISKAN, C. (2012). A faster polynomial algorithm for the constrained maximum flow problem. Computers & operations research, 39(11), 2634-2641. https://doi.org/10.1016/j.cor.2012.01.010
Citácia podle Chicago (17th ed.)CALISKAN, Cenk. "A Faster Polynomial Algorithm for the Constrained Maximum Flow Problem." Computers & Operations Research 39, no. 11 (2012): 2634-2641. https://doi.org/10.1016/j.cor.2012.01.010.
Citácia podľa MLA (8th ed.)CALISKAN, Cenk. "A Faster Polynomial Algorithm for the Constrained Maximum Flow Problem." Computers & Operations Research, vol. 39, no. 11, 2012, pp. 2634-2641, https://doi.org/10.1016/j.cor.2012.01.010.
Upozornenie: Tieto citáce sú generované automaticky. Nemusia byť úplne správne podľa citačných pravidiel..