Re: [igraph] Maximum Common Subgraph

[Mark Galea]

Hi Arpad,

Thanks a lot for your reply.  I am currently using Python as my language.  

A and B are labels of the nodes.  I want a similar algorithm of the sub-isomorphism with the added constrain that the mapped nodes actually match the corresponding labels on both graph.

I would really appreciate if you could provide an outline of the algorithm.  

Cheers, 

Mark

2011/3/11 Horváth Árpád <address@hidden>

 Dear Mark,

I think, it is quite easy to write a code to select the edges, that are
including in both graphs. A and B are the name attributes of the
vertices in your graphs?
What language do you use? Python, R or C?

 Regards, Arpad


 Mark Galea írta (Dátum: 2011. Mar. 11.)

> Hi there,
>
> I am trying to find to get the maximum common subgraph given two
> graphs however I cannot seem to find this in the library.  Am I
> missing something?
>
> Given that Graph 1 is
>
> A - B
> A - C
> B - D
> D - E
>
> Graph 2 is
>
> A - B
> A - E
> B - D
>
> Than the algorithm should return
> A - B
> B - D
>
> Sub-isomorphism is not taking into account the unique node labels.  Is
> there a way to do this? It is a bit odd that such a functionality is
> not provided.
>
> Regards ,
>
> Mark

--
Arpad Horvath <address@hidden>
Homepage: http://www.arek.uni-obuda.hu/harp/english.html
Workplace: Obuda University, Hungary
Phone: +36 22 316 260 ext. 125 ||  Fax: +36 22 312 337

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