Authors: Lucas Allen
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.
Comments: English, 9 pages, matrix equations and examples
[v1] 2016-06-07 19:53:07
Unique-IP document downloads: 120 times
Add your own feedback and questions here:
You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.