home *** CD-ROM | disk | FTP | other *** search
- Path: sparky!uunet!munnari.oz.au!manuel.anu.edu.au!tyl.anu.edu.au!not-for-mail
- From: bdm@cs.anu.edu.au (Brendan McKay)
- Newsgroups: comp.theory
- Subject: Re: Swart and Gismondi Graph Isomorphism algorithm
- Date: 1 Jan 1993 17:17:06 +1100
- Organization: Australian National University
- Lines: 19
- Distribution: world
- Message-ID: <1i0nl2INN6as@tyl.anu.edu.au>
- References: <1ht5atINN4iu@nunki.anu.edu.au> <C044ur.Lt8@research.canon.oz.au>
- NNTP-Posting-Host: 150.203.23.70
- Keywords: Maybe its right
-
- naylor@research.canon.oz.au (William Naylor) writes:
-
- >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.).
-
- Not necessarily. You make it sound like there is some sinister plot
- to suppress results like this. In order for a paper claiming a
- ground-breaking result (like ISOM in P) to be accepted for publication
- it is insufficient to merely be correct. It must (actually _should)
- also be readily seen to be correct by an expert who reads it with
- the intense skepticism that comes from reading too many faulty
- claims in the past. In my opinion, the Gismondi-Swart paper cannot
- yet pass this test, though I eagerly await Mike Robson's revision.
-
- >Will Naylor net: naylor@research.canon.oz.au
-
- Brendan.
-