An Updated Experimental Evaluation of Graph Bipartization Methods
DOI10.1145/3467968zbMath1499.68271arXiv1805.01041OpenAlexW3207086400MaRDI QIDQ5102059
Timothy D. Goodrich, Eric Horton, Blair D. Sullivan
Publication date: 6 September 2022
Published in: ACM Journal of Experimental Algorithmics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1805.01041
Programming involving graphs or networks (90C35) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Quantum algorithms and complexity in the theory of computing (68Q12)
Cites Work
- Unnamed Item
- Unnamed Item
- Minor-embedding in adiabatic quantum computation. II: Minor-universal graph design
- Finding odd cycle transversals.
- Branch-and-reduce exponential/FPT algorithms in practice: a case study of vertex cover
- Optimizing adiabatic quantum program compilation using a graph-theoretic framework
- Connected components in random graphs with given expected degree sequences
- Identifying the minor set cover of dense connected bipartite graphs via random matching edge sets
- Adaptive Memory Tabu Search for Binary Quadratic Programs
- Statistical mechanics of complex networks
- O(√log n) approximation algorithms for min UnCut, min 2CNF deletion, and directed cut problems
- Algorithm Engineering for Optimal Graph Bipartization
- Simpler Parameterized Algorithm for OCT
- A Simple Parallel Algorithm for the Maximal Independent Set Problem
- LP-branching algorithms based on biased graphs
- Compression via Matroids
- Faster Parameterized Algorithms Using Linear Programming
- Linear-Time FPT Algorithms via Network Flow
- k-Degenerate Graphs
This page was built for publication: An Updated Experimental Evaluation of Graph Bipartization Methods
