[Top][All Lists]
[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: [igraph] similarity between networks
From: |
Tamas Nepusz |
Subject: |
Re: [igraph] similarity between networks |
Date: |
Tue, 20 Jan 2009 09:29:40 +0000 |
> is there a method to do the maximum common
> subgraph problem?
No, there isn't at the moment :(
> However, for large networks this is infeasible. Has anybody employed
> the technique described in http://arxiv.org/abs/cond-mat/0703470.
None that I am aware of, but it seems not too complicated; BFS traversal
is already in igraph, all that you need is to conduct a BFS traversal
from every node and build the appropriate matrix.
--
Tamas