Dyer, M., Heinrich, M., Jerrum, M., & Müller, H. (2021). Polynomial-time approximation algorithms for the antiferromagnetic Ising model on line graphs. Combinatorics, probability & computing, 30(6), 905-921. https://doi.org/10.1017/S0963548321000080
Citace podle Chicago (17th ed.)Dyer, Martin, Marc Heinrich, Mark Jerrum, a Haiko Müller. "Polynomial-time Approximation Algorithms for the Antiferromagnetic Ising Model on Line Graphs." Combinatorics, Probability & Computing 30, no. 6 (2021): 905-921. https://doi.org/10.1017/S0963548321000080.
Citace podle MLA (9th ed.)Dyer, Martin, et al. "Polynomial-time Approximation Algorithms for the Antiferromagnetic Ising Model on Line Graphs." Combinatorics, Probability & Computing, vol. 30, no. 6, 2021, pp. 905-921, https://doi.org/10.1017/S0963548321000080.