Surely many of you have seen the blogosphere erupt with a nearly P algorithm for graph isomorphism. I don't have any sense as to whether this is an actually implementable one that would be faster than e.g. nauty, but wondering whether anyone has a sense of this. There was already a social media comment, "Let's hope that the algorithm is practical enough to make its way into software soon. I'd like to see an implementation in Sage Math, for example."
-- You received this message because you are subscribed to the Google Groups "sage-devel" group. To unsubscribe from this group and stop receiving emails from it, send an email to sage-devel+unsubscr...@googlegroups.com. To post to this group, send email to sage-devel@googlegroups.com. Visit this group at http://groups.google.com/group/sage-devel. For more options, visit https://groups.google.com/d/optout.
