Separator-based data reduction for signed graph balancing
From MaRDI portal
Publication:613659
Recommendations
Cites work
- scientific article; zbMATH DE number 2080088 (Why is no real title available?)
- scientific article; zbMATH DE number 835749 (Why is no real title available?)
- scientific article; zbMATH DE number 2234775 (Why is no real title available?)
- A Local-Search 2-Approximation for 2-Correlation-Clustering
- A mathematical bibliography of signed and gain graphs and allied areas
- Algorithms and experiments for parameterized approaches to hard graph problems
- Almost 2-SAT Is Fixed-Parameter Tractable (Extended Abstract)
- Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization
- Computing Vertex Connectivity: New Bounds from Old Techniques
- Crown structures for vertex cover kernelization
- Dividing a Graph into Triconnected Components
- Edge-Deletion Problems
- Experimental and Efficient Algorithms
- Facets of the balanced (acyclic) induced subgraph polytope
- Finding odd cycle transversals.
- Fixed-Parameter Algorithms for Cluster Vertex Deletion
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Iterative Compression for Exactly Solving NP-Hard Minimization Problems
- Mining market data: a network approach
- On the notion of balance of a signed graph
- On the power of unique 2-prover 1-round games
- Optimization, approximation, and complexity classes
- Parameterized and Exact Computation
- Parametrized complexity theory.
- Path-based depth-first search for strong and biconnected components
- Practical Partitioning-Based Methods for the Steiner Problem
- Short rational generating functions for lattice point problems
- Signed graphs for portfolio analysis in risk management
- Social balance on networks: the dynamics of friendship and enmity
- Statistical analysis of financial networks
- The max-cut problem and quadratic 0-1 optimization; polyhedral aspects, relaxations and bounds
- The multi-multiway cut problem
- Vertex cover: Further observations and further improvements
- Weakly bipartite graphs and the max-cut problem
- \(O(\sqrt{\log n})\) approximation algorithms for Min UnCut, Min 2CNF deletion, and directed cut problems
Cited in
(9)- Optimal Edge Deletions for Signed Graph Balancing
- A modeling and computational study of the frustration index in signed networks
- Linear kernels and linear-time algorithms for finding large cuts
- Compression via matroids: a randomized polynomial kernel for odd cycle transversal
- Graph modification for edge-coloured and signed graph homomorphism problems: parameterized and classical complexity
- The maximum balanced subgraph of a signed graph: applications and solution approaches
- A heuristic based on negative chordless cycles for the maximum balanced induced subgraph problem
- Stabilizing social structure via modifying local patterns
- Evaluating balancing on social networks through the efficient solution of correlation clustering problems
This page was built for publication: Separator-based data reduction for signed graph balancing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q613659)
