Wu, Z., Karimi, H. R., & Dang, C. (2019). An approximation algorithm for graph partitioning via deterministic annealing neural network. Neural networks, 117, 191-200. https://doi.org/10.1016/j.neunet.2019.05.010
Citácia podle Chicago (17th ed.)Wu, Zhengtian, Hamid Reza Karimi, a Chuangyin Dang. "An Approximation Algorithm for Graph Partitioning via Deterministic Annealing Neural Network." Neural Networks 117 (2019): 191-200. https://doi.org/10.1016/j.neunet.2019.05.010.
Citácia podľa MLA (8th ed.)Wu, Zhengtian, et al. "An Approximation Algorithm for Graph Partitioning via Deterministic Annealing Neural Network." Neural Networks, vol. 117, 2019, pp. 191-200, https://doi.org/10.1016/j.neunet.2019.05.010.
Upozornenie: Tieto citáce sú generované automaticky. Nemusia byť úplne správne podľa citačných pravidiel..