Re: (Probably flawed) Polynomial time Graph Isomorphism

Hey, Bytecool. Glad to see you keep yourself busy reading Usenet
news. Actually, I use to post frequently back in the late 80-s, and
early 90-s, then I lost access. It's nice to have Google providing it!

I'm a bit zorched today, so I doubt I'll make more progress. However,
I think I'll probably be able to find a counter-example that shows this
hash-based labeling of nodes isn't enough to differentiate asymmetric
nodes. I'm upgrading the code to look for such cases...

There's an equivalent thread in sci.crypt where a couple guys have made
significant progress analyzing this algorithm. It's at:

http://groups.google.com/group/sci.crypt/browse_thread/thread/079227a49dd64623/229f2580fa487470#229f2580fa487470

yaoziyuan@xxxxxxxxx wrote:
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!

.