A branch-and-cut algorithm for the maximum k-balanced subgraph of a signed graph.
Rosa FigueiredoYuri FrotaMartine LabbéPublished in: Discret. Appl. Math. (2019)
Keyphrases
- np hard
- matching algorithm
- tree structure
- expectation maximization
- objective function
- graph structure
- probabilistic model
- learning algorithm
- simulated annealing
- maximum flow
- minimum spanning tree
- search space
- computational complexity
- optimal solution
- dynamic programming
- cost function
- k means
- graph construction
- maximum weight
- graph based algorithm
- similarity graph