A branch-and-cut algorithm for the maximum \(k\)-balanced subgraph of a signed graph
From MaRDI portal
Publication:2414463
DOI10.1016/j.dam.2018.11.022zbMath1410.05200OpenAlexW2906557555MaRDI QIDQ2414463
Yuri Frota, Martine Labbé, Rosa M. V. Figueiredo
Publication date: 17 May 2019
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2018.11.022
Social networks; opinion dynamics (91D30) Integer programming (90C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Signed and weighted graphs (05C22)
Related Items (2)
An Agent-Based Approach to Stability of Complete, Directed, and Signed Social Networks with Loops ⋮ Integer programming formulations and efficient local search for relaxed correlation clustering
Cites Work
- Unnamed Item
- Polyhedral combinatorics of the \(K\)-partitioning problem with representative variables
- Correlation clustering
- An exact approach to the problem of extracting an embedded network matrix
- Facets of the balanced (acyclic) induced subgraph polytope
- On conditions for a meeting not to reach a deadlock
- A simple algorithm to detect balance in signed graphs
- Variable neighborhood search
- A mathematical bibliography of signed and gain graphs and allied areas
- Extracting pure network submatrices in linear programs using signed graphs.
- Evaluating balancing on social networks through the efficient solution of correlation clustering problems
- A good submatrix is hard to find
- Characterization of clusterability of signed graph in terms of Newcomb's balance of sentiments
- Clusterability of groups and information exchange in group decision making with approval voting system.
- Conflict graphs in solving integer programming problems
- The maximum balanced subgraph of a signed graph: applications and solution approaches
- On the asymmetric representatives formulation for the vertex coloring problem
- Correlation clustering in general weighted graphs
- A note on a matrix criterion for unique colorability of a signed graph
- Clustering with qualitative information
- A Branch-and-Cut Algorithm for Equitable Coloring based on a Formulation by Representatives
- A Class Representative Model for Pure Parsimony Haplotyping
- A branch-and-cut algorithm for partition coloring
- n-person ‘soft’ games
- Structural Balance: A Dynamic Perspective
- Solving Airline Crew Scheduling Problems by Branch-and-Cut
- Community structure in social and biological networks
This page was built for publication: A branch-and-cut algorithm for the maximum \(k\)-balanced subgraph of a signed graph
