Re:Quasi-Polynomial Algorithm for Graph Isomorphism
by bmh100 on Wednesday November 04, 2015 @04:45PM
(#10510017)
Since you seem knowledgeable about this area, do you know a good algorithm for generating isomorphic forms of a given weighted acyclic directional graph? I would be looking to reduce nesting level and/or total edge count.
[ Parent
| on HN ]
Re:Quasi-Polynomial Algorithm for Graph Isomorphism
by gone35 on Thursday November 12, 2015 @12:22PM
(#10554518)
Sorry not my field! But I would first give NAUTY[1] a try before trying more exotic, structure-exploiting stuff.
[1] http://www3.cs.stonybrook.edu/~algorith/implement/nauty/impl...