Integer programming models for detecting graph bipartitions with structural requirements

DOI10.1002/net.21786zbMath1394.05104OpenAlexW2765499731MaRDI QIDQ4584872

Jose L. Walteros, Chrysafis Vogiatzis

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

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)

Related Items (3)

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

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