[igraph] similarity between networks

[Rajarshi Guha]

Hi, when considering similarity between two networks, one possibility  
is to identify the maximum common subgraph. I see methods for graph  
and subgraph isomorphism - is there a method to do the maximum common  
subgraph problem?

However, for large networks this is infeasible. Has anybody employed  
the technique described in http://arxiv.org/abs/cond-mat/0703470.  
While still O(n^2), at least it is not NP-complete.

-------------------------------------------------------------------
Rajarshi Guha  <address@hidden>
GPG Fingerprint: D070 5427 CC5B 7938 929C  DD13 66A1 922C 51E7 9E84
-------------------------------------------------------------------