Parallel Algorithm for Solving the Graph Isomorphism Problem
In this paper, we offer an efficient parallel algorithm for solving the Graph Isomorphism Problem. Our goal is to construct a suitable vertex substitution or to prove the absence of such. The problem is solved for undirected graphs without loops and multiple edges, it is assumed that the graphs can...
| 主要作者: | |
|---|---|
| 格式: | 文件 |
| 语言: | English |
| 出版: |
Yaroslavl State University
2020-03-01
|
| 丛编: | Моделирование и анализ информационных систем |
| 主题: | |
| 在线阅读: | https://www.mais-journal.ru/jour/article/view/1290 |