Re: (Probably flawed) Polynomial time Graph Isomorphism

Hey Bill, nice to see you here... I'm the BTSlave-likeminded guy on
your Yahoo Messenger... It seems to be your first series of posts on
the Usenet :O


Bill Cox wrote:
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!

.