Swart and Gismondi Graph Isomorphism algorithm

Article View: comp.theory

Article #1696

#1696

From: Mike Robson
Date: Wed, 30 Dec 1992 21:46

3 lines
655 bytes

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.

Technical Details

Message-ID: <1ht5atINN4iu@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-mail

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: Swart and Gismondi Graph Isomorphism algorithm
Date: 31 Dec 1992 08:46:05 +1100
Organization: Computer Science Department, ANU, Australia
Lines: 3
Distribution: inet
Message-ID: <1ht5atINN4iu@nunki.anu.edu.au>
NNTP-Posting-Host: nunki.anu.edu.au
Keywords: Maybe its right