[Top][All Lists]
[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: [igraph] Maximum Common Subgraph
From: |
Tamas Nepusz |
Subject: |
Re: [igraph] Maximum Common Subgraph |
Date: |
Fri, 11 Mar 2011 11:50:11 +0100 |
User-agent: |
Mozilla/5.0 (X11; U; Linux x86_64; en-US; rv:1.9.2.14) Gecko/20110223 Lightning/1.0b2 Thunderbird/3.1.8 |
> I think, it is quite easy to write a code to select the edges, that are
> including in both graphs.
Assuming that the vertices are in the same order in both graphs (i.e.
vertex C has the same index in both graphs). Otherwise it is equivalent
to the subgraph isomorphism problem; one possible way to solve it would
be to re-arrange the vertices in both graphs such that vertices with the
same name also have the same ID, and then run the subgraph isomorphism
search.
--
Tamas
- [igraph] Maximum Common Subgraph, Mark Galea, 2011/03/10
- Re: [igraph] Maximum Common Subgraph, Horváth Árpád, 2011/03/11
- Re: [igraph] Maximum Common Subgraph, Mark Galea, 2011/03/11
- Re: [igraph] Maximum Common Subgraph,
Tamas Nepusz <=
- 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, Mark Galea, 2011/03/11