An improved Branch-and-cut code for the maximum balanced subgraph of a signed graph
Discrete Mathematics
2013-12-17 v1 Data Structures and Algorithms
Abstract
The Maximum Balanced Subgraph Problem (MBSP) 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.
Keywords
Cite
@article{arxiv.1312.4345,
title = {An improved Branch-and-cut code for the maximum balanced subgraph of a signed graph},
author = {Rosa Figueiredo and Yuri Frota},
journal= {arXiv preprint arXiv:1312.4345},
year = {2013}
}