bdm@anucsd.UUCP (01/30/86)
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 ]