Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Path: utzoo!watmath!clyde!burl!ulysses!mhuxr!mhuxt!houxm!whuxl!whuxlm!akgua!gatech!seismo!munnari!basser!anucsd!bdm
From: bdm@anucsd.UUCP
Newsgroups: net.wanted.sources,net.math
Subject: wanted: graph isomorphism programs
Message-ID: <206@anucsd.anu.OZ>
Date: Thu, 30-Jan-86 00:22:42 EST
Article-I.D.: anucsd.206
Posted: Thu Jan 30 00:22:42 1986
Date-Received: Sat, 1-Feb-86 05:49:23 EST
Organization: Computer Science, Australian National Uni, Canberra
Lines: 21
Keywords: graph isomorphism automorphism
Xref: watmath net.wanted.sources:1813 net.math:2760

I am interested in hearing about any programs which solve the graph
isomorphism (or automorphism) problem for general graphs, preferably
those for which source is (or may be) available.  These are needed
for a comparative study of such programs.

Please note that I am after working programs, as opposed to algorithms;
I already have dozens of the latter.  On the other hand, pointers to
unpublished technical reports, etc., would also be welcome.

1K thanks in advance.


Brendan McKay.
Computer Science Dept., Australian National University, GPO Box 4, Canberra,
ACT 2601, Australia.

ACSnet: bdm@anucsd.anu.oz	  		ARPA:  bdm%anucsd.anu.oz@seismo	
CSNET:  bdm@anucsd.anu.oz@csnet-relay.csnet	JANET: anucsd.anu.oz!bdm@ukc
UUCP:   {decvax,vax135,pesnta,eagle}!mulga!anucsd.anu.oz!bdm           or
        {seismo,ubc-vision,ukc,mcvax,prlb2}!munnari!anucsd.anu.oz!bdm
       	  [ UUCP routes through munnari prefered ]