Re: [igraph] Constraints Preventing large

[Gábor Csárdi]

Ulrike,

I've just added colored matching support to igraph, here is a source R package:
http://cneurocvs.rmki.kfki.hu/igraph/download/igraph_0.6.tar.gz
Tell me if you need a windows package or the C library.

The code is currently undocumented, but it is easy to use, just supply
the color vectors to the VF2 functions. It was also not much tested,
only on toy graphs.

FYI,
G.

2009/3/30 Ulrike Grömping <address@hidden>:
> Dear igraph-helpers,
>
> this morning's idea was not so good, it is not sufficient to just permute
> the outer nodes, the inner ones have to be permuted with them. So I cannot
> use graph isomorphism without colors. However, I suppose that graph
> isomorphism with colors is also not the best solution to my problem. It
> would be easy in terms of writing the code, but presumably quite slow in
> many applications. I may have to write something specific, because there is
> a strong structural relation between inner and outer vertices, and they
> would have to be permuted alongside according to that relation.
>
> Well, my enthusiasm that graphs solved my previous problem so easily made me
> a bit too optimistic on this one ...
>
> Regards,
> Ulrike
>
> _______________________________________________
> igraph-help mailing list
> address@hidden
> http://lists.nongnu.org/mailman/listinfo/igraph-help
>
>



-- 
Gabor Csardi <address@hidden>     UNIL DGM