Pages that link to "Item:Q977873"

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

Displaying 50 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)
• Anti-modularity and anti-community detecting in complex networks (Q726563) (← links)
• Modularity density of network community divisions (Q833179) (← links)
• Community structures of networks (Q926319) (← links)
• A vector partitioning approach to detecting community structure in complex networks (Q945179) (← links)
• Modularity maximization using completely positive programming (Q1620447) (← links)
• Exact computational solution of modularity density maximization by effective column generation (Q1652372) (← links)
• Post-processing partitions to identify domains of modularity optimization (Q1657058) (← links)
• A constrained power method for community detection in complex networks (Q1719174) (← links)
• Community structure detection for directed networks through modularity optimisation (Q1736848) (← links)
• A novel mixed integer linear programming model for clustering relational networks (Q1743542) (← links)
• Efficient modularity density heuristics for large graphs (Q1751717) (← links)
• Modified modularity density maximization and density ratio heuristic (Q2108173) (← links)
• Partition network into communities based on group action on sets (Q2148620) (← links)
• Additive approximation algorithms for modularity maximization (Q2221809) (← links)
• A modularity-maximization-based approach for detecting multi-communities in social networks (Q2241189) (← links)
• Redundant constraints in the standard formulation for the clique partitioning problem (Q2257087) (← links)
• A doubly nonnegative relaxation for modularity density maximization (Q2297659) (← links)
• Maximizing Barber's bipartite modularity is also hard (Q2355315) (← links)
• The maximum balanced subgraph of a signed graph: applications and solution approaches (Q2356257) (← links)
• Revealing network communities with a nonlinear programming method (Q2510154) (← links)
• A hybrid artificial immune network for detecting communities in complex networks (Q2517303) (← links)
• A dimensionality reduction framework for detection of multiscale structure in heterogeneous networks (Q2637276) (← links)
• Fractional interaction of financial agents in a stock market network (Q2690711) (← links)
• The maximum community partition problem in networks (Q2874043) (← links)
• Optimal Containment of Misinformation in Social Media: A Scenario-Based Approach (Q2942429) (← links)
• On the relationship between Gaussian stochastic blockmodels and label propagation algorithms (Q3302212) (← links)
• Enhancing community detection by using local structural information (Q3302580) (← links)
• Community detection based on significance optimization in complex networks (Q3303057) (← links)
• Searching Graph Communities by Modularity Maximization via Convex Optimization (Q3467881) (← links)
• On Finding Graph Clusterings with Maximum Modularity (Q3508560) (← links)
• Exhaustive Community Enumeration in Parallel (Q4598918) (← links)
• Simplified Energy Landscape for Modularity Using Total Variation (Q4686633) (← links)
• Adding cohesion constraints to models for modularity maximization in networks (Q4689363) (← links)
• A classification for community discovery methods in complex networks (Q4969805) (← links)
• Toward Optimal Community Detection: From Trees to General Weighted Networks (Q4985780) (← links)
• Social Network Optimization for Cluster Ensemble Selection (Q4988940) (← links)
• Identifying multi-scale communities in networks by asymptotic surprise (Q5006949) (← links)
• Metric-Constrained Optimization for Graph Clustering Algorithms (Q5025762) (← links)
• Using Mathematical Programming to Refine Heuristic Solutions for Network Clustering (Q5265217) (← links)
• A CUTTING PLANE ALGORITHM FOR MODULARITY MAXIMIZATION PROBLEM (Q5267565) (← links)
• (Q5298937) (← links)
• A DC Programming Approach for Finding Communities in Networks (Q5383809) (← links)