Erratum

Corrigendum to: V. V. Vasilchikov, “Parallel algorithm for solving the graph isomorphism problem”, Modeling and analysis of information systems, vol. 27, no. 1, pp. 86-94, 2020. doi: https://doi.org/10.18255/1818-1015-2020-1-86-94

V. V. Vasil'chikov

P. G. Demidov Yaroslavl State University, 14 Sovetskaya str., Yaroslavl 150003, Russia

Abstract: In the article by V. V. Vasilchikov “Parallel Algorithm for Solving the Graph Isomorphism Problem” ( Modeling and analysis of information systems, vol. 27, no. 1, pp. 86-94, 2020; DOI: https://doi.org/10.18255/1818-1015-2020-1-86-94) there was a misprint in the layout. In the Table 1, in the last column of the row “Degree of graph” the value should be 3000 (instead of 300). The corrected “Table 1” is shown below. The editors apologise for the inconvenience.

Keywords: graph isomorphism problem, parallel algorithm, recursion, .NET.

UDC: 519.688: 519.85

MSC: 68W10

Received: 25.08.2021
Revised: 25.08.2021
Accepted: 25.08.2021

DOI: 10.18255/1818-1015-2021-3-312-313