Algorithm Engineering for Optimal Graph Bipartization
From MaRDI portal
Publication:3627967
DOI10.7155/jgaa.00177zbMath1210.05110OpenAlexW2105680721MaRDI QIDQ3627967
Publication date: 19 May 2009
Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/45460
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)
Related Items (11)
On Polynomial Kernels for Structural Parameterizations of Odd Cycle Transversal ⋮ On bipartization of cubic graphs by removal of an independent set ⋮ The Impact of Parameterized Complexity to Interdisciplinary Problem Solving ⋮ Hitting Selected (Odd) Cycles ⋮ An Updated Experimental Evaluation of Graph Bipartization Methods ⋮ Branch-and-reduce exponential/FPT algorithms in practice: a case study of vertex cover ⋮ Focused jump-and-repair constraint handling for fixed-parameter tractable graph problems closed under induced subgraphs ⋮ Another disjoint compression algorithm for odd cycle transversal ⋮ Edge bipartization faster than \(2^k\) ⋮ Fixed-Parameter Algorithms in Analysis of Heuristics for Extracting Networks in Linear Programs ⋮ Unnamed Item
This page was built for publication: Algorithm Engineering for Optimal Graph Bipartization
