(Probably flawed) Polynomial time Graph Isomorphism

I've written a graph isomorphism program that determines if two graphs
are isomorphic. It runs in O(N^3).

Since graph isomorphism is a long studied problem with (AFAIK) no known
polynomial time solution, my algorithm is more than likely flawed. Any
help finding the flaws would be appreciated! The web site is

http://www.billrocks.org/ideas

Thanks!

.

Relevant Pages

  • Re: Need Graph Isomorphism Algorithm De-bunked
    ... Since graph isomorphism is a long studied problem with (AFAIK) no known ... my algorithm is more than likely flawed. ... this is a randomized algorithm that has a probability of failing (that is, ...
    (sci.crypt)
  • Need Graph Isomorphism Algorithm De-bunked
    ... I thought this forum might be a good place to post, ... isomorphism is commonly suggested for use in cryptography. ... I've written a graph isomorphism program that determines if two graphs ... Since graph isomorphism is a long studied problem with no known ...
    (sci.crypt)