Optimal edge deletions for signed graph balancing

Authors:
Falk Hüffner;Nadja Betzler;Rolf Niedermeier
Affiliations:
Institut für Informatik, Friedrich-Schiller-Universität Jena, Jena, Germany;Institut für Informatik, Friedrich-Schiller-Universität Jena, Jena, Germany;Institut für Informatik, Friedrich-Schiller-Universität Jena, Jena, Germany
Venue:
WEA'07 Proceedings of the 6th international conference on Experimental algorithms
Year:
2007

Citing 11
Cited 6

Computing vertex connectivity: new bounds from old techniques

Journal of Algorithms
Path-based depth-first search for strong and biconnected components

Information Processing Letters
Approximation algorithms

Approximation algorithms
On the power of unique 2-prover 1-round games

STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)

Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization

Journal of Computer and System Sciences
Invitation to data reduction and problem kernelization

ACM SIGACT News
Practical partitioning-based methods for the steiner problem

WEA'06 Proceedings of the 5th international conference on Experimental Algorithms
Algorithmic and complexity results for decompositions of biological networks into monotone subsystems

WEA'06 Proceedings of the 5th international conference on Experimental Algorithms
Algorithm engineering for optimal graph bipartization

WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
Fast and Efficient Bright-Field AAPSM Conflict Detection and Correction

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

A Local-Search 2-Approximation for 2-Correlation-Clustering

ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Iterative Compression for Exactly Solving NP-Hard Minimization Problems

Algorithmics of Large and Complex Networks
Graph-theoretic topological control of biological genetic networks

ACC'09 Proceedings of the 2009 conference on American Control Conference
Balanced bipartite graph based register allocation for network processors in mobile and wireless networks

Mobile Information Systems - Mobile and Wireless Networks
Graph-based decomposition of biochemical reaction networks into monotone subsystems

WABI'11 Proceedings of the 11th international conference on Algorithms in bioinformatics
Maximum balanced subgraph problem parameterized above lower bound

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Balanced Subgraph problem (edge deletion variant) asks for a 2-coloring of a graph that minimizes the inconsistencies with given edge labels. It has applications in social networks, systems biology, and integrated circuit design. We present an exact algorithm for BALANCED SUBGRAPH based on a combination of data reduction rules and a fixed-parameter algorithm. The data reduction is based on finding small separators and a novel gadget construction scheme. The fixed-parameter algorithm is based on iterative compression with a very effective heuristic speedup. Our implementation can solve biological real-world instances exactly for which previously only approximations [DasGupta et al., WEA 2006] were known.