3. Main overlap detection methods
3.1 Unipartite graphs
Strategies for detecting overlapping communities from possibly weighted unipartite graphs often extend partitioning methods. For example, they use k-clique percolation , or random walk in a graph
Exclusive to subscribers. 97% yet to be discovered!
Already subscribed? Log in!
Main overlap detection methods
Community stability and Nash equilibrium
Bibliography
Exclusive to subscribers. 97% yet to be discovered!
Already subscribed? Log in!
Article included in this offer
"Digital documents and content management"
(
77 articles
)
Updated and enriched with articles validated by our scientific committees
A set of exclusive tools to complement the resources
