Heuristic algorithm for solving of the graph isomorphism problem
R. T. Faizullin, A. V. Prolubnikov
Abstract
We consider heuristic algorithm for solving graph isomorphism problem. The algorithm based on a successive splitting of the eigenvalues of the matrices which are modifications (to positive defined) of graphs' adjacency matrices. Modification of the algorithm allows to find a solution for Frobenius problem. Formulation of the Frobenius problem is following one. Given a pair of two matrices with the same number of rows and columns. We must find out whether one of the matrix can be acquired from another by permutation of it's rows and strings or not. For example, solution of Frobenius problem can give to us efficient way for decrypting of double permutation cyphers problem for high dimension matrices.
Create a lesson
Related papers
On the Rank Condition for Perfect Cuboids
Valery Asiryan
A Local Proof of Langlands's First Main Lemma for Local Epsilon Factors over Nonarchimedean Local Fields
Fukuhiro Ueda
The first type of power mean bounds for the Gaussian hypergeometric function
Zhen-Hang, Yang, Jing-Feng Tian
On a new class of q-fractional integral operators involving multivariate q-Mittag-Leffler functions
Min-Jie Luo, Qing-Hui Peng, Ravinder Krishna Raina
Partition-theoretic density formulas: radial Tauberian theory and non-radial instability
Mohammad F. Marashdeh
Octonionic Kittaneh Numerical Radius Inequalities
K. Mahesh Krishna