Click here to Skip to main content
15,314,594 members
Articles / General Programming / Algorithms

Proposal: O(N^5) algorithm solving Graph Isomorphism problem (comparison of graphs)

26 Feb 2012CPOL
With a high certainty, I guess this polynomial-time algorithm solves Graph Isomorphism problem in general case. In the absence of possibility to spend time on its proof or work in a team, I put the algorithm online so that you can see whether it works well for your scientific or production needs and
We're sorry, but the article you are trying to view was deleted at 2 Jul 2017.

Please go to the Algorithms Table of Contents to view the list of available articles in this section.