On Mon, Sep 17, 2012 at 5:03 PM, Tamás Nepusz <[email protected]> wrote: >> If I load them as edgelist, then only the directed version is quick, >> the undirected one takes long, maybe forever. LAD is very fast on the >> undirected one as well. > > Good catch. Indeed I tried only the directed version. > > The BLISS isomorphism algorithm is also very fast and it does not require the > instalation of the development version, so maybe the original poster could > also try that.
BLISS is indeed the preferable method for undirected graph isomorphism. Nevertheless I have reported a bug for this one: https://bugs.launchpad.net/igraph/+bug/1052213 Gabor [...] -- Gabor Csardi <[email protected]> MTA KFKI RMKI _______________________________________________ igraph-help mailing list [email protected] https://lists.nongnu.org/mailman/listinfo/igraph-help
