A branch-and-cut algorithm for the maximum \(k\)-balanced subgraph of a signed graph (Q2414463)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A branch-and-cut algorithm for the maximum \(k\)-balanced subgraph of a signed graph |
scientific article |
Statements
A branch-and-cut algorithm for the maximum \(k\)-balanced subgraph of a signed graph (English)
0 references
17 May 2019
0 references
signed graph
0 references
balanced graph
0 references
graph partition
0 references
integer programming
0 references
social networks
0 references
0 references
0 references
0 references
0 references
0 references
