Re: [igraph] Complex node attributes for subgraph isomorphism via vf2

[Moses Boudourides]

Hi,

I don't have an answer but I also have a related question which might
be solved indirectly through the solution to Nick's problem (or it
could be even simpler).

What I want to do is to find graph anti-isomorphisms. By
anti-isomorphic I mean a graph which is isomorphic to a (proper) edge
induced subgraph of the graph complement of another graph (of course
provided that the graphs are not complete).

How would the igraph.isomorphic functions (under the BLISS or the VF2
algorithms) work in this case?

I would appreciate your assistance.

--Moses


On Tue, Jan 17, 2012 at 6:42 AM, Nicholas Dahm <address@hidden> wrote:
> Hi,
>
> Is there any way to create my own function to compare node attributes
> when using vf2 to find subgraph isomorphism?
>
> For example, I previously used Foggia's implementation where there was a
> "SetNodeCompat(node_compat_fn)" which I could point to my own "bool
> is_compat(void *p1, void *p2)" function to decide if they are
> compatible.
>
> Unfortunately, due to my extremely complex node attributes, along with a
> complex procedure for matching them, I really need to write the function
> myself.
>
> cheers
>
> Nick
>
>
>
> _______________________________________________
> igraph-help mailing list
> address@hidden
> https://lists.nongnu.org/mailman/listinfo/igraph-help