Re: Swart and Gismondi Graph Isomorphism algorithm

Article View: comp.theory

Article #1701

#1701

From: William Naylor
Date: Thu, 31 Dec 1992 07:30

11 lines
993 bytes

It would be a very damning comment on the computer science theory 
establishment if it eventually turns out that the Gismondi&Swart graph-iso
paper has any merit, and yet is was not accepted for presentation at
the major theory conferences (STOC, etc.).


-- 
Will Naylor               net:  naylor@research.canon.oz.au
                          mail: Canon Information Systems Research Australia  
phone: (61-2) 805-2921          P.O. Box 313 North Ryde, NSW 2113 
fax:   (61-2) 805-2929          Australia

Technical Details

Message-ID: <C044ur.Lt8@research.canon.oz.au>

Path: arc1-ca.pugleaf.net!sparky!uunet!munnari.oz.au!metro!mama!naylor

References: <1ht5atINN4iu@nunki.anu.edu.au>

Show Full Headers

Complete Article Headers

Newsgroups: comp.theory
Path: arc1-ca.pugleaf.net!sparky!uunet!munnari.oz.au!metro!mama!naylor
From: naylor@research.canon.oz.au (William Naylor)
Subject: Re: Swart and Gismondi Graph Isomorphism algorithm
Message-ID: <C044ur.Lt8@research.canon.oz.au>
Keywords: Maybe its right
Sender: news@research.canon.oz.au
Organization: Canon Information Systems Research Australia
References: <1ht5atINN4iu@nunki.anu.edu.au>
Distribution: inet
Date: Thu, 31 Dec 1992 07:30:27 GMT
Lines: 11

Reply to Parent Message