American Psychological Association 6th edition

Smirnov, A. V. (2023). The Polynomial Algorithm of Finding the Shortest Path in a Divisible Multiple Graph. Automatic Control and Computer Sciences, 57(7), 841-853. https://doi.org/10.3103/s0146411623070143

ISO-690 (author-date, English)

SMIRNOV, A. V., 2023. The Polynomial Algorithm of Finding the Shortest Path in a Divisible Multiple Graph. Automatic Control and Computer Sciences. 1 December 2023. Vol. 57, no. 7, p. 841-853. DOI 10.3103/s0146411623070143.

Modern Language Association 9th edition

Smirnov, A. V. “The Polynomial Algorithm of Finding the Shortest Path in a Divisible Multiple Graph”. Automatic Control and Computer Sciences, vol. 57, no. 7, Dec. 2023, pp. 841-53, https://doi.org/10.3103/s0146411623070143.

Mohr Siebeck - Recht (Deutsch - Österreich)

Smirnov, A. V.: The Polynomial Algorithm of Finding the Shortest Path in a Divisible Multiple Graph, Automatic Control and Computer Sciences 2023, 841-853.

Emerald - Harvard

Smirnov, A.V. (2023), “The Polynomial Algorithm of Finding the Shortest Path in a Divisible Multiple Graph”, Automatic Control and Computer Sciences, Vol. 57 No. 7, pp. 841-853.

Warning: These citations may not always be 100% accurate.