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
Chicago-Zitierstil (17. Ausg.)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.
MLA-Zitierstil (9. Ausg.)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.
Achtung: Diese Zitate sind unter Umständen nicht zu 100% korrekt.