Facets of the balanced (acyclic) induced subgraph polytope
Mathematical Programming: Series A and B
Theory of finite and infinite graphs
Theory of finite and infinite graphs
Computing vertex connectivity: new bounds from old techniques
Journal of Algorithms
Path-based depth-first search for strong and biconnected components
Information Processing Letters
Vertex cover: further observations and further improvements
Journal of 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
A Linear Time Implementation of SPQR-Trees
GD '00 Proceedings of the 8th International Symposium on Graph Drawing
O(√log n) approximation algorithms for min UnCut, min 2CNF deletion, and directed cut problems
Proceedings of the thirty-seventh 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)
Mining market data: a network approach
Computers and Operations Research
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
The multi-multiway cut problem
Theoretical Computer Science
Crown Structures for Vertex Cover Kernelization
Theory of Computing Systems
An analogue of the Myhill-Nerode theorem and its use in computing finite-basis characterizations
SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
Almost 2-SAT Is Fixed-Parameter Tractable (Extended Abstract)
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part I
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
Fixed-parameter algorithms for cluster vertex deletion
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Practical partitioning-based methods for the steiner problem
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
Finding odd cycle transversals
Operations Research Letters
Combinatorial Optimization on Graphs of Bounded Treewidth
The Computer Journal
Compression via matroids: a randomized polynomial kernel for odd cycle transversal
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
| Hi-index | 0.00 |
Polynomial-time data reduction is a classical approach to hard graph problems. Typically, particular small subgraphs are replaced by smaller gadgets. We generalize this approach to handle any small subgraph that has a small separator connecting it to the rest of the graph. The problem we study is the NP-hard Balanced Subgraph problem, which 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. The data reduction scheme unifies and generalizes a number of previously known data reductions, and can be applied to a large number of graph problems where a coloring or a subset of the vertices is sought. To solve the instances that remain after reduction, we use a fixed-parameter algorithm based on iterative compression with a very effective heuristic speedup. Our implementation can solve biological real-world instances exactly for which previously only approximations were known. In addition, we present experimental results for financial networks and random networks.