Haese, R., Heller, T., & Krumke, S. O. (2024). Algorithms and complexity for the almost equal maximum flow problem. Networks, 83(4), 642-652. https://doi.org/10.1002/net.22209
Citace podle Chicago (17th ed.)Haese, Rebekka, Till Heller, a Sven O. Krumke. "Algorithms and Complexity for the Almost Equal Maximum Flow Problem." Networks 83, no. 4 (2024): 642-652. https://doi.org/10.1002/net.22209.
Citace podle MLA (9th ed.)Haese, Rebekka, et al. "Algorithms and Complexity for the Almost Equal Maximum Flow Problem." Networks, vol. 83, no. 4, 2024, pp. 642-652, https://doi.org/10.1002/net.22209.
Upozornění: Tyto citace jsou generovány automaticky. Nemusí být zcela správně podle citačních pravidel..