scientific article
From MaRDI portal
Publication:2904774
DOI10.4230/LIPIcs.STACS.2012.338zbMath1245.68111MaRDI QIDQ2904774
M. S. Ramanujan, Saket Saurabh, N. S. Narayanaswamy, Venkatesh Raman
Publication date: 23 August 2012
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (17)
A Randomized Polynomial Kernelization for Vertex Cover with a Smaller Parameter ⋮ Designing FPT Algorithms for Cut Problems Using Randomized Contractions ⋮ Parameterized complexity of MaxSat above average ⋮ Solving min ones 2-SAT as fast as vertex cover ⋮ On the parameterized vertex cover problem for graphs with perfect matching ⋮ Reducing the vertex cover number via edge contractions ⋮ Data reductions and combinatorial bounds for improved approximation algorithms ⋮ What Is Known About Vertex Cover Kernelization? ⋮ Unnamed Item ⋮ On the parameterized complexity of vertex cover and edge cover with connectivity constraints ⋮ Faster graph bipartization ⋮ Half-integrality, LP-branching, and FPT Algorithms ⋮ New Algorithms for Edge Induced König-Egerváry Subgraph Based on Gallai-Edmonds Decomposition ⋮ Rank Vertex Cover as a Natural Problem for Algebraic Compression ⋮ Parameterized algorithms and complexity for the traveling purchaser problem and its variants ⋮ Above guarantee parameterization for vertex cover on graphs with maximum degree 4 ⋮ On group feedback vertex set parameterized by the size of the cutset
This page was built for publication:
