Parallel Algorithm for Solving the Graph Isomorphism Problem

被引：0
作者：
V. V. Vasilchikov
机构：
[1] Demidov Yaroslavl State University,
来源：
Automatic Control and Computer Sciences | 2021年 / 55卷
关键词：
graph isomorphism problem; parallel algorithm; recursion; .NET;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
收藏
页码：617 / 622
页数：5
相关论文
共 18 条
  • [1] Schmidt D.C.(1976)A fast backtracking algorithm to test directed graphs for isomorphism using distance matrices J. ACM 23 433-445
  • [2] Druffel L.E.(2013)Polynomial algorithm of computing complete graph invariant on the basis of integral structure descriptor Bull. Tomsk Polytech. Univ. 323 152-159
  • [3] Pogrebnoy V.K.(2013)Polynomiality of method for computing graph structure integral descriptor Bull. Tomsk Polytech. Univ. 323 146-151
  • [4] Pogrebnoy A.(2014)Complete graph invariant and algorithm of its computation Bull. Tomsk Polytech. Univ. 325 110-122
  • [5] Pogrebnoy V.K.(2015)Method of graph vertices differentiation and solution of the isomorphism problem Bull. Tomsk Polytech. Univ. 326 34-45
  • [6] Pogrebnoy A.(2015)Method of graph vertices differentiation and solution of the isomorphism problem in geoinformatics Bull. Tomsk Polytech. Univ. 326 56-66
  • [7] Pogrebnoy A.(2019)Algorithms of comparative analysis of two invariants of a graph, IT-Obraz. 15 45-51
  • [8] Pogrebnoy A.(2014)On the recursive-parallel programming for the. NET framework Autom. Control Comput. Sci. 48 575-580
  • [9] Pogrebnoy V.K.(2017)On optimization and parallelization of the little algorithm for solving the travelling salesman problem Autom. Control Comput. Sci. 51 551-557
  • [10] Pogrebnoy A.(2018)On a recursive-parallel algorithm for solving the knapsack problem Autom. Control Comput. Sci. 52 810-816
12