Heuristic algorithm for solving of the graph isomorphism problem

Details Heuristic algorithm for solving of the graph isomorphism problem Heuristic algorithm for solving of the graph isomorphism problem

2002-05-21

arxiv.org/abs/math/0205220v1

Mathematics

General Mathematics

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Heuristic algorithm for solving of the graph isomorphism problem does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Heuristic algorithm for solving of the graph isomorphism problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Heuristic algorithm for solving of the graph isomorphism problem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-455019