Gutin, G., & Yeo, A. (2023). (1,1)-Cluster Editing is polynomial-time solvable. Discrete Applied Mathematics, 340, 259-271. https://doi.org/10.1016/j.dam.2023.07.002
Citace podle Chicago (17th ed.)Gutin, Gregory, a Anders Yeo. "(1,1)-Cluster Editing Is Polynomial-time Solvable." Discrete Applied Mathematics 340 (2023): 259-271. https://doi.org/10.1016/j.dam.2023.07.002.
Citace podle MLA (9th ed.)Gutin, Gregory, a Anders Yeo. "(1,1)-Cluster Editing Is Polynomial-time Solvable." Discrete Applied Mathematics, vol. 340, 2023, pp. 259-271, https://doi.org/10.1016/j.dam.2023.07.002.
Upozornění: Tyto citace jsou generovány automaticky. Nemusí být zcela správně podle citačních pravidel..