Ageev, A. A., Il’ev, V. P., Kononov, A. V., & Talevnin, A. S. (2007). Computational complexity of the graph approximation problem. Journal of applied and industrial mathematics, 1(1), 1-8. https://doi.org/10.1134/S1990478907010012
Citace podle Chicago (17th ed.)Ageev, A. A., V. P. Il’ev, A. V. Kononov, a A. S. Talevnin. "Computational Complexity of the Graph Approximation Problem." Journal of Applied and Industrial Mathematics 1, no. 1 (2007): 1-8. https://doi.org/10.1134/S1990478907010012.
Citace podle MLA (9th ed.)Ageev, A. A., et al. "Computational Complexity of the Graph Approximation Problem." Journal of Applied and Industrial Mathematics, vol. 1, no. 1, 2007, pp. 1-8, https://doi.org/10.1134/S1990478907010012.
Upozornění: Tyto citace jsou generovány automaticky. Nemusí být zcela správně podle citačních pravidel..