<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.3 20210610//EN" "JATS-journalpublishing1-3.dtd">
<article article-type="research-article" dtd-version="1.3" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xml:lang="ru"><front><journal-meta><journal-id journal-id-type="publisher-id">mais</journal-id><journal-title-group><journal-title xml:lang="ru">Моделирование и анализ информационных систем</journal-title><trans-title-group xml:lang="en"><trans-title>Modeling and Analysis of Information Systems</trans-title></trans-title-group></journal-title-group><issn pub-type="ppub">1818-1015</issn><issn pub-type="epub">2313-5417</issn><publisher><publisher-name>Yaroslavl State University</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="doi">10.18255/1818-1015-2021-3-312-313</article-id><article-id custom-type="elpub" pub-id-type="custom">mais-1530</article-id><article-categories><subj-group subj-group-type="heading"><subject>Research Article</subject></subj-group><subj-group subj-group-type="section-heading" xml:lang="ru"><subject>Erratum</subject></subj-group><subj-group subj-group-type="section-heading" xml:lang="en"><subject>Erratum</subject></subj-group></article-categories><title-group><article-title>Исправление к статье: В. В. Васильчиков, «Параллельный алгоритм решения задачи об изоморфизме графов», Моделирование и анализ информационных систем, Том 27, №1, с. 86–94, 2020. DOI: https://doi.org/10.18255/1818-1015-2020-1-86-94</article-title><trans-title-group xml:lang="en"><trans-title>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</trans-title></trans-title-group></title-group><contrib-group><contrib contrib-type="author" corresp="yes"><contrib-id contrib-id-type="orcid">https://orcid.org/0000-0001-7882-8906</contrib-id><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Васильчиков</surname><given-names>Владимир Васильевич</given-names></name><name name-style="western" xml:lang="en"><surname>Vasilchikov</surname><given-names>Vladimir Vasilyevich</given-names></name></name-alternatives><bio xml:lang="ru"><p>Кандидат технических наук, заведующий кафедрой вычислительных и программных систем.</p><p>Ул. Советская, д. 14, Ярославль, 150003</p></bio><bio xml:lang="en"><p>PhD.</p><p>14 Sovetskaya str., Yaroslavl 150003</p></bio><email xlink:type="simple">vvv193@mail.ru</email><xref ref-type="aff" rid="aff-1"/></contrib></contrib-group><aff-alternatives id="aff-1"><aff xml:lang="ru"><institution>Ярославский государственный университет им. П.Г. Демидова</institution><country>Россия</country></aff><aff xml:lang="en"><institution>P.G. Demidov Yaroslavl State University</institution><country>Russian Federation</country></aff></aff-alternatives><pub-date pub-type="collection"><year>2021</year></pub-date><pub-date pub-type="epub"><day>12</day><month>10</month><year>2021</year></pub-date><volume>28</volume><issue>3</issue><fpage>312</fpage><lpage>313</lpage><permissions><copyright-statement>Copyright &amp;#x00A9; Васильчиков В.В., 2021</copyright-statement><copyright-year>2021</copyright-year><copyright-holder xml:lang="ru">Васильчиков В.В.</copyright-holder><copyright-holder xml:lang="en">Vasilchikov V.V.</copyright-holder><license xml:lang="ru" license-type="creative-commons-attribution" xlink:href="https://creativecommons.org/licenses/by/4.0/" xlink:type="simple"><license-p>Данная работа распространяется под лицензией Creative Commons Attribution 4.0.</license-p></license><license xml:lang="en" license-type="creative-commons-attribution" xlink:href="https://creativecommons.org/licenses/by/4.0/" xlink:type="simple"><license-p>This work is licensed under a Creative Commons Attribution 4.0 License.</license-p></license></permissions><self-uri xlink:href="https://www.mais-journal.ru/jour/article/view/1530">https://www.mais-journal.ru/jour/article/view/1530</self-uri><abstract><p>В статье В.В. Васильчикова «Параллельный алгоритм решения задачи об изоморфизме графов» (Моделирование и анализ информационных систем, том 27, №1, с. 86–94, 2020; https://doi.org/10.18255/1818-1015-2020-1-86-94) при вёрстке была допущена опечатка. В таблице 1 в последнем столбце строки «Степень графа» должно быть значение 3000 (вместо 300). Исправленная «Таблица 1» приводится ниже. Редакция приносит извинения за доставленные неудобства.</p></abstract><trans-abstract xml:lang="en"><p>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.</p></trans-abstract><kwd-group xml:lang="ru"><kwd>изоморфизм графов</kwd><kwd>параллельный алгоритм</kwd><kwd>рекурсия</kwd><kwd>.NET</kwd></kwd-group><kwd-group xml:lang="en"><kwd>graph isomorphism problem</kwd><kwd>parallel algorithm</kwd><kwd>recursion</kwd><kwd>.NET</kwd></kwd-group></article-meta></front><back><ref-list><title>References</title></ref-list><fn-group><fn fn-type="conflict"><p>The authors declare that there are no conflicts of interest present.</p></fn></fn-group></back></article>
