Integer programming models for detecting graph bipartitions with structural requirements

DOI10.1002/NET.21786zbMATH Open1394.05104OpenAlexW2765499731MaRDI QIDQ4584872FDOQ4584872

Authors: Chrysafis Vogiatzis, Jose L. Walteros 

Publication date: 4 September 2018

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.21786

Recommendations

• Linear and quadratic programming approaches for the general graph partitioning problem
• Size-constrained graph partitioning polytopes
• Star partitions on graphs
• Polyhedral results for the bipartite induced subgraph problem
• A locally optimal hierarchical divisive heuristic for bipartite modularity maximization

zbMATH Keywords

graph partitioningclique relaxationsdata classificationnormalized cut

Mathematics Subject Classification ID

Fractional programming (90C32) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cited In (5)

• Solving graph partitioning on sparse graphs: cuts, projections, and extended formulations
• Polarization reduction by minimum‐cardinality edge additions: Complexity and integer programming approaches
• On maximum ratio clique relaxations
• A survey on optimization studies of group centrality metrics
• Integer Programming of Biclustering Based on Graph Models

This page was built for publication: Integer programming models for detecting graph bipartitions with structural requirements

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4584872)