Integer programming models for detecting graph bipartitions with structural requirements

DOI10.1002/NET.21786MaRDI QIDQ4584872zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

clique relaxationsdata classificationgraph partitioningnormalized cut

Mathematics Subject Classification ID

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

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

Cited in

(5)

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

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)