|
|
|
The maximum balanced subgraph of a signed graph:
Let G be a signed graph. The
Maximum Balanced Subgraph Problem is the problem of finding a subgraph
of G
that is balanced and maximizes the cardinality of its vertex set. This
problem has applications in the detection of embedded matrices,
portfolio analysis in risk management and community structure.
Instances for this problem are available here. Results obtained with exact and
heuristic methods are available here. |
|
|
|
|