Article View: comp.theory
Article #1706Re: Swart and Gismondi Graph Isomorphism algorithm
From: Mike Robson
Date: Sat, 02 Jan 1993 07:15
Date: Sat, 02 Jan 1993 07:15
15 lines
1046 bytes
1046 bytes
jmr@cs.anu.edu.au (Mike Robson) writes: >With their new version of the discredited main theorem, I currently >believe that their algorithm can be proved correct. I'll post details >when I've thought them out a bit more and when I have time. Sorry to everyone. I thought I had seen a simple way to prove their revised theorem (that any solution to F3 has a subpattern which is the pattern of a Q vector). My idea was wrong. I promise not to post any more bright ideas until I have worked out the details thoroughly. Mike Robson.
Technical Details
Message-ID:
<1i3ferINN53m@nunki.anu.edu.au>Path:
arc1-ca.pugleaf.net!sparky!uunet!munnari.oz.au!manuel.anu.edu.au!dubhe.anu.edu.au!nunki.anu.edu.au!not-for-mailReferences:
<1ht5atINN4iu@nunki.anu.edu.au>Show Full Headers
Complete Article Headers
Path: arc1-ca.pugleaf.net!sparky!uunet!munnari.oz.au!manuel.anu.edu.au!dubhe.anu.edu.au!nunki.anu.edu.au!not-for-mail From: jmr@cs.anu.edu.au (Mike Robson) Newsgroups: comp.theory Subject: Re: Swart and Gismondi Graph Isomorphism algorithm Date: 2 Jan 1993 18:15:39 +1100 Organization: Computer Science Department, ANU, Australia Lines: 16 Distribution: inet Message-ID: <1i3ferINN53m@nunki.anu.edu.au> References: <1ht5atINN4iu@nunki.anu.edu.au> NNTP-Posting-Host: nunki.anu.edu.au Keywords: Retraction