Graph bipartization and via minimization
SIAM Journal on Discrete Mathematics
Parameterizing above guaranteed values: MaxSat and MaxCut
Journal of Algorithms
New graph bipartizations for double-exposure, bright field alternating phase-shift mask layout
Proceedings of the 2001 Asia and South Pacific Design Automation Conference
Introduction to Algorithms
Approximate Max-Flow Min-(Multi)Cut Theorems and Their Applications
SIAM Journal on Computing
WABI '02 Proceedings of the Second International Workshop on Algorithms in Bioinformatics
Exact algorithms for NP-hard problems: a survey
Combinatorial optimization - Eureka, you shrink!
Resolving Register Bank Conflicts for a Network Processor
Proceedings of the 12th International Conference on Parallel Architectures and Compilation Techniques
Finding odd cycle transversals
Operations Research Letters
Parameterized Complexity
Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization
Journal of Computer and System Sciences
Iterative Compression for Exactly Solving NP-Hard Minimization Problems
Algorithmics of Large and Complex Networks
Almost 2-SAT is fixed-parameter tractable
Journal of Computer and System Sciences
Optimal edge deletions for signed graph balancing
WEA'07 Proceedings of the 6th international conference on Experimental algorithms
A practical parameterized algorithm for the individual haplotyping problem MLF
TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
Separator-based data reduction for signed graph balancing
Journal of Combinatorial Optimization
A practical parameterised algorithm for the individual haplotyping problem mlf†
Mathematical Structures in Computer Science
Compression via matroids: a randomized polynomial kernel for odd cycle transversal
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Improved fixed-parameter algorithms for two feedback set problems
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
Parameterised algorithms of the individual haplotyping problem with gaps
International Journal of Bioinformatics Research and Applications
| Hi-index | 0.00 |
We examine exact algorithms for the NP-complete Graph Bipartization problem that asks for a minimum set of vertices to delete from a graph to make it bipartite. Based on the “iterative compression” method recently introduced by Reed, Smith, and Vetta, we present new algorithms and experimental results. The worst-case time complexity is improved from O(3k · kmn) to O(3k · mn), where n is the number of vertices, m is the number of edges, and k is the number of vertices to delete. Our best algorithm can solve all problems from a testbed from computational biology within minutes, whereas established methods are only able to solve about half of the problems within reasonable time.