[Top][All Lists]

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

Re: [igraph] edge-rotation graph distance

From: Gábor Csárdi
Subject: Re: [igraph] edge-rotation graph distance
Date: Wed, 30 Mar 2011 10:01:26 -0400


On Wed, Mar 30, 2011 at 8:54 AM, sergiu netotea
<address@hidden> wrote:
> Hi,
> Can I find an implementation of edge-rotation-, edge-slide-, or
> whatever-really-distance between graphs (trees suffices) in igraph?

this is not implemented in igraph.

> If not, do you know if it is implemented somewhere? Or if there is an
> efficient algorithm for it.. what does igraph use for computing
> isomorphism?

There are two algorithms in igraph for this. BLISS (which a
reimplementation of nauty basically) for undirected graphs, and VF2
for directed graphs and subgraph isomorphism.


> Thanks,
> Sergiu
> _______________________________________________
> igraph-help mailing list
> address@hidden
> http://lists.nongnu.org/mailman/listinfo/igraph-help

Gabor Csardi <address@hidden>     MTA KFKI RMKI

reply via email to

[Prev in Thread] Current Thread [Next in Thread]