[Top][All Lists]
[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: [igraph] Maximum Common Subgraph
From: |
Horváth Árpád |
Subject: |
Re: [igraph] Maximum Common Subgraph |
Date: |
Fri, 11 Mar 2011 11:37:40 +0100 |
User-agent: |
Mutt/1.5.20 (2009-06-14) |
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] Maximum Common Subgraph, Mark Galea, 2011/03/10
- Re: [igraph] Maximum Common Subgraph,
Horváth Árpád <=
- Re: [igraph] Maximum Common Subgraph, Mark Galea, 2011/03/11
- Re: [igraph] Maximum Common Subgraph, Tamas Nepusz, 2011/03/11
- Re: [igraph] Maximum Common Subgraph, Mark Galea, 2011/03/11
- Re: [igraph] Maximum Common Subgraph, Tamas Nepusz, 2011/03/11
- Re: [igraph] Maximum Common Subgraph, Mark Galea, 2011/03/11
- Re: [igraph] Maximum Common Subgraph, Tamas Nepusz, 2011/03/11
- Re: [igraph] Maximum Common Subgraph, Mark Galea, 2011/03/11
- Re: [igraph] Maximum Common Subgraph, Tamas Nepusz, 2011/03/11
- Re: [igraph] Maximum Common Subgraph, Mark Galea, 2011/03/11
- Re: [igraph] Maximum Common Subgraph, Tamas Nepusz, 2011/03/11