Pages that link to "Item:Q2414463"
From MaRDI portal
The following pages link to A branch-and-cut algorithm for the maximum \(k\)-balanced subgraph of a signed graph (Q2414463):
Displaying 7 items.
- A heuristic based on negative chordless cycles for the maximum balanced induced subgraph problem (Q342319) (← links)
- Maximum balanced subgraph problem parameterized above lower bound (Q391973) (← links)
- Integer programming formulations and efficient local search for relaxed correlation clustering (Q2052402) (← links)
- The maximum balanced subgraph of a signed graph: applications and solution approaches (Q2356257) (← links)
- A matheuristic approach for the maximum balanced subgraph of a signed graph (Q5034728) (← links)
- An Agent-Based Approach to Stability of Complete, Directed, and Signed Social Networks with Loops (Q5049408) (← links)
- Efficient enumeration of the optimal solutions to the correlation clustering problem (Q6162510) (← links)
