APA-Zitierstil (7. Ausg.)

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

Chicago-Zitierstil (17. Ausg.)

Ageev, A. A., V. P. Il’ev, A. V. Kononov, und 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.

MLA-Zitierstil (9. Ausg.)

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.