Yu, J., Hu, J., Gao, J., Du, D., & Zhang, X. (2025). Algorithms for 2-balanced connected k-partition problem in graphs. Journal of combinatorial optimization, 50(1), 4. https://doi.org/10.1007/s10878-025-01332-0
Citace podle Chicago (17th ed.)Yu, Junran, Jing Hu, Jiaquan Gao, Donglei Du, a Xiaoyan Zhang. "Algorithms for 2-balanced Connected K-partition Problem in Graphs." Journal of Combinatorial Optimization 50, no. 1 (2025): 4. https://doi.org/10.1007/s10878-025-01332-0.
Citace podle MLA (9th ed.)Yu, Junran, et al. "Algorithms for 2-balanced Connected K-partition Problem in Graphs." Journal of Combinatorial Optimization, vol. 50, no. 1, 2025, p. 4, https://doi.org/10.1007/s10878-025-01332-0.
Upozornění: Tyto citace jsou generovány automaticky. Nemusí být zcela správně podle citačních pravidel..