[1] viXra:1606.0074 [pdf] submitted on 2016-06-07 19:53:07
Authors: Lucas Allen
Comments: English, 9 pages, matrix equations and examples
This article presents an algorithm for solving the graph isomorphism problem. Under certain circumstances the algorithm is definitely polynomial time, and it could possibly always be polynomial time, but that hasn't been verified. The algorithm also hasn't been tested on graphs with more than three nodes, nor has it been reviewed by anyone so far.
Category: Combinatorics and Graph Theory