|
From: | Sirinda Palahan |
Subject: | Re: [igraph] overlapping community detection |
Date: | Wed, 14 Mar 2012 17:43:25 -0400 |
Yes, I am searching for methods that discover subgraphs or communities in graphs that don't contain any clique.
Actually, what I really want is a method to find a partition of edges, not nodes. Anyway, the two recommended papers are very useful to me. Thank you very much. Any other suggestions would be very welcomed. Thanks again. Sirinda Date: Wed, 14 Mar 2012 22:30:50 +0800 From: address@hidden To: address@hidden Subject: Re: [igraph] overlapping community detection Hi Sirinda, I think you mean the method unrelated of Clique Percolation Method. You can check this paper http://www.sciencedirect.com/science/article/pii/S0370157309002841 It's a summarize about community detection and you can find out what you want in subsection B of section XI. Evan 2012/3/14 Sirinda Palahan <address@hidden>
_______________________________________________ igraph-help mailing list address@hidden https://lists.nongnu.org/mailman/listinfo/igraph-help |
[Prev in Thread] | Current Thread | [Next in Thread] |