Pages that link to "Item:Q1936247"

The following pages link to On the complexity of Newman's community finding approach for biological and social networks (Q1936247):

Displaying 9 items.

• Mixing local and global information for community detection in large networks (Q394992) (← links)
• A near-optimal adaptive algorithm for maximizing modularity in dynamic scale-free networks (Q498452) (← links)
• The parameterised complexity of computing the maximum modularity of a graph (Q786031) (← links)
• A review of two network curvature measures (Q1982207) (← links)
• Why did the shape of your network change? (On detecting network anomalies via non-local curvatures) (Q2182087) (← links)
• Additive approximation algorithms for modularity maximization (Q2221809) (← links)
• On a connection between small set expansions and modularity clustering (Q2446591) (← links)
• Toward Optimal Community Detection: From Trees to General Weighted Networks (Q4985780) (← links)
• (Q5009471) (← links)