Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!turpin
From: turpin@cs.utexas.edu (Russell Turpin)
Newsgroups: comp.theory
Subject: Re: Graph isomorphism alg. ?
Summary: Me, I just want to know if it is polynomial or not.
Message-ID: <10188@cs.utexas.edu>
Date: 17 Jul 90 19:33:22 GMT
References: <785@imada.dk>
Distribution: comp
Organization: U. Texas CS Dept., Austin, Texas
Lines: 11

-----
In article <785@imada.dk>, paw@imada.dk (Paw Hermansen) writes:
>    Does anyone know the current state of algorithms for
> graph isomorphism ?
>    I'm looking for "the best" method to use if I want to
> see if any two given graphs are equivallent.

Personally, I'd just like a proof that graph isomorphism is
either (a) polynomial or (b) NP-hard.  I am bothered by
these problems that resist being shoved either way.

Russell