A study on modularity density maximization: column generation acceleration and computational complexity analysis

DOI10.1016/j.ejor.2023.01.061arXiv2206.10901OpenAlexW4318817049MaRDI QIDQ6112587

Atsushi Miyauchi, Akiko Takeda, Issey Sukeda

Publication date: 10 July 2023

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2206.10901

zbMATH Keywords

column generationcombinatorial optimizationcommunity detectionmodularity densitydense subgraph discovery

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• MILP formulations for the modularity density maximization problem
• Divisive heuristic for modularity density maximization
• The complexity of finding uniform sparsest cuts in various graph classes
• Reformulation of a model for hierarchical divisive graph modularity maximization
• Modularity-maximizing graph communities via mathematical programming
• Diagnosing infeasibilities in network flow problems
• Exact computational solution of modularity density maximization by effective column generation
• An enhanced MILP-based branch-and-price approach to modularity density maximization on graphs
• Complete mixed integer linear programming formulations for modularity density based clustering
• Efficient modularity density heuristics for large graphs
• The densest subgraph problem with a convex/concave size function
• Real-time freight locomotive rescheduling and uncovered train detection during disruption
• Modularized convex nonnegative matrix factorization for community detection in signed and unsigned networks
• Additive approximation algorithms for modularity maximization
• A doubly nonnegative relaxation for modularity density maximization
• Finding network communities using modularity density
• Generating Sparse 2-Spanners
• Community structure in social and biological networks
• Network community detection using modularity density measures
• Toward Optimal Community Detection: From Trees to General Weighted Networks
• Fast unfolding of communities in large networks
• A CUTTING PLANE ALGORITHM FOR MODULARITY MAXIMIZATION PROBLEM

This page was built for publication: A study on modularity density maximization: column generation acceleration and computational complexity analysis