Thanks! Raphael
On 11 September 2012 20:49, Tamás Nepusz <[email protected]> wrote: > Hi Raphael, > > We have recently added the LAD subisomorphism algorithm which is capable of > finding induced subgraph isomorphisms. This is currently included only in the > source repository but no release have been made yet. If you are willing to > use a nightly snapshot of igraph and you don't mind compiling it yourself, > grab the latest nightly from here: > > http://code.google.com/p/igraph/downloads/list > > Use the snapshot from the 0.7 tree. If you use igraph from R, you only need > the GNU R source package. If you use igraph from Python, you will need both > the C library and the Python source package. The name of the function is > igraph_subisomorphic_lad in C, subisomorphic.lad in R and > Graph.subisomorphic_lad in Python. > > Best,-- > T. > > > On Tuesday, 11 September 2012 at 21:44, Raphael Clifford wrote: > >> I realise this is asking a lot but, I was wondering if anyone had (or >> had any plans to have) implemented a heuristic for induced subgraph >> isomorphism. If I am correct, the current VF2 implementation would >> say that a-b-c-d is isomorphic to a subgraph of a 4-clique while it is >> not an induced subgraph. (See >> http://en.wikipedia.org/wiki/Induced_subgraph_isomorphism_problem.) >> >> Raphael >> >> _______________________________________________ >> igraph-help mailing list >> [email protected] (mailto:[email protected]) >> https://lists.nongnu.org/mailman/listinfo/igraph-help >> > > > > > _______________________________________________ > igraph-help mailing list > [email protected] > https://lists.nongnu.org/mailman/listinfo/igraph-help _______________________________________________ igraph-help mailing list [email protected] https://lists.nongnu.org/mailman/listinfo/igraph-help
