An improved Branch-and-cut code for the maximum balanced subgraph of a signed graph

Rosa Figueiredo (1) , Yuri Y. Frota (2)

1 LIA - Laboratoire Informatique d'Avignon
2 IC-UFF - Instituto de Computação [Niteroi-Rio de Janeiro]

The Maximum Balanced Subgraph Problem is the problem of finding a subgraph of a signed graph that is balanced and maximizes the cardinality of its vertex set. We are interested in the exact solution of the problem: an improved version of a branch-and-cut algorithm is proposed. Extensive computational experiments are carried out on a set of instances from three applications previously discussed in the literature as well as on a set of random instances.

Mots clés: Balanced signed graph; Branch-and-cut; Portfolio analysis; Network matrix; Community structure

Domaines: Recherche opérationnelle [math.OC]; Mathématique discrète [cs.DM]

Rosa Figueiredo, Yuri Y. Frota. An improved Branch-and-cut code for the maximum balanced subgraph of a signed graph. [Research Report] arXiv:1312.4345. 2013. ⟨hal-02188356⟩