Pages that link to "Item:Q977873"

The following pages link to Modularity-maximizing graph communities via mathematical programming (Q977873):

Displaying 12 items.

• Community detection by modularity maximization using GRASP with path relinking (Q336716) (← links)
• Clustering of high throughput gene expression data (Q339649) (← links)
• Divisive heuristic for modularity density maximization (Q342346) (← links)
• Community detection in networks via a spectral heuristic based on the clustering coefficient (Q403568) (← links)
• Improving heuristics for network modularity maximization using an exact algorithm (Q406498) (← links)
• A combinatorial model and algorithm for globally searching community structure in complex networks (Q437056) (← links)
• Reformulation of a model for hierarchical divisive graph modularity maximization (Q490216) (← links)
• A near-optimal adaptive algorithm for maximizing modularity in dynamic scale-free networks (Q498452) (← links)
• Modularity maximization using completely positive programming (Q1620447) (← links)
• Exact computational solution of modularity density maximization by effective column generation (Q1652372) (← links)
• A novel mixed integer linear programming model for clustering relational networks (Q1743542) (← links)
• Efficient modularity density heuristics for large graphs (Q1751717) (← links)