Everybody knows nauty (and maybe traces?) is the state of the art in graph isomorphism and canonical labeling of graphs. What I don't know (but maybe you do?) is how far SageMath is lagging behind. Did anyone do any testing on this? I saw a mention of a paper by Robert Miller, but the link was dead.
Not sure whether you can use it for graph isomorphism in Sage easily, though.
Permission is hereby given for use and/or distribution with the exception of sale for profit or application with nontrivial military significance. You must not remove this copyright notice, and you must document any changes that you make to this program. This software is subject to this copyright only, irrespective of any copyright attached to any package of which this is a part.
Nathann
Cool. I'm up for doing that. So.. I need to bring nauty using cython and call the is_isomorphic function?
--
You received this message because you are subscribed to a topic in the Google Groups "sage-devel" group.
To unsubscribe from this topic, visit https://groups.google.com/d/topic/sage-devel/mKZ1Ar1lJG0/unsubscribe.
To unsubscribe from this group and all its topics, send an email to sage-devel+...@googlegroups.com.
--
Jori Mäntysalo