Algorithm engineering for optimal graph bipartization
From MaRDI portal
Recommendations
- Algorithm Engineering for Optimal Graph Bipartization
- Engineering multilevel graph partitioning algorithms
- scientific article; zbMATH DE number 5761786
- Algorithmic aspects of bipartite graphs
- Graph Bipartization and via minimization
- Efficient algorithms for a graph partitioning problem
- A linear algorithm for bipartition of biconnected graphs
- An algorithm for improving graph partitions
- scientific article; zbMATH DE number 7651215
Cited in
(17)- Almost 2-SAT is fixed-parameter tractable
- A probabilistic estimator for the vertex deletion problem
- Optimizing adiabatic quantum program compilation using a graph-theoretic framework
- Speeding up Exact Algorithms With High Probability
- scientific article; zbMATH DE number 4135976 (Why is no real title available?)
- scientific article; zbMATH DE number 4150228 (Why is no real title available?)
- Algorithm Engineering for Optimal Graph Bipartization
- Iterative Compression for Exactly Solving NP-Hard Minimization Problems
- Confronting intractability via parameters
- The Maximum k-Colorable Subgraph Problem and Related Problems
- An Updated Experimental Evaluation of Graph Bipartization Methods
- Theoretical Computer Science
- Compression via matroids: a randomized polynomial kernel for odd cycle transversal
- Separator-based data reduction for signed graph balancing
- A practical exact algorithm for the individual haplotyping problem MEC/GI
- Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization
- An improved (and practical) parameterized algorithm for the individual haplotyping problem MFR with mate-pairs
This page was built for publication: Algorithm engineering for optimal graph bipartization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5710023)
