A locally optimal hierarchical divisive heuristic for bipartite modularity maximization

DOI10.1007/s11590-013-0621-xzbMath1292.90301OpenAlexW2077382842MaRDI QIDQ2448169

Alberto L. C. Costa, Pierre Hansen

Publication date: 30 April 2014

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-013-0621-x

zbMATH Keywords

clusteringbipartite graphsmodularity maximization

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items

Divisive heuristic for modularity density maximization ⋮ Density-based modularity for evaluating community structure in bipartite networks ⋮ Quantitative function and algorithm for community detection in bipartite networks ⋮ Production planning and scheduling in mining scenarios under IPCC mining systems ⋮ Modified modularity density maximization and density ratio heuristic ⋮ Maximizing Barber's bipartite modularity is also hard

Uses Software

• Pajek
• CPLEX
• Pajek datasets

Cites Work

• Unnamed Item
• Reformulation of a model for hierarchical divisive graph modularity maximization
• Model of community emergence in weighted social networks
• Compact mathematical formulation for graph partitioning
• Finding community structures in complex networks using mixed integer optimisation
• Linear and quadratic programming approaches for the general graph partitioning problem
• Branching and bounds tighteningtechniques for non-convex MINLP
• On Finding Graph Clusterings with Maximum Modularity
• Reformulations in Mathematical Programming: Definitions and Systematics
• Community structure in social and biological networks

This page was built for publication: A locally optimal hierarchical divisive heuristic for bipartite modularity maximization