Paper Info
Title
An improved Branch-and-cut code for the maximum balanced subgraph of a signed graph.
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.
Year
Venue
Field
2013
arXiv: Discrete Mathematics
Discrete mathematics,Combinatorics,Signed graph,Maximum common subgraph isomorphism problem,Graph factorization,Cardinality,Induced subgraph isomorphism problem,Distance-hereditary graph,Factor-critical graph,Subgraph isomorphism problem,Mathematics
DocType
Volume
Citations 
Journal
abs/1312.4345
3
PageRank 
References 
Authors
0.40
9
2
Name
Order
Citations
PageRank
Rosa M. V. Figueiredo1539.43
Yuri Frota210513.98