An enhanced MILP-based branch-and-price approach to modularity density maximization on graphs.
Keisuke SatoYoichi IzunagaPublished in: Comput. Oper. Res. (2019)
Keyphrases
- linear program
- community detection
- graph theoretic
- objective function
- mixed integer linear programming
- graph theory
- graph structure
- weighted graph
- graph representation
- graph matching
- community detection algorithms
- resource constrained project scheduling problem
- spanning tree
- series parallel
- low density
- subgraph isomorphism
- graph clustering
- graph model
- graph partitioning
- complex structures
- graph mining
- mathematical programming
- directed graph
- markov random field
- evolutionary algorithm