paw@imada.dk (Paw Hermansen) (07/17/90)
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. Thanks paw@imada.dk (Paw Hermansen)
turpin@cs.utexas.edu (Russell Turpin) (07/18/90)
----- 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