Paths, Flowers and Vertex Cover

DOI10.1007/978-3-642-23719-5_33zbMath1346.05287OpenAlexW87291490MaRDI QIDQ3092246

M. S. Ramanujan, Saket Saurabh, Venkatesh Raman

Publication date: 16 September 2011

Published in: Algorithms – ESA 2011 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-23719-5_33

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (17)

On Multiway Cut Parameterized above Lower Bounds ⋮ A Randomized Polynomial Kernelization for Vertex Cover with a Smaller Parameter ⋮ Constraint Satisfaction Problems Parameterized above or below Tight Bounds: A Survey ⋮ Parameterized complexity of satisfying almost all linear equations over \(\mathbb F_2\) ⋮ Vertex cover kernelization revisited. Upper and lower bounds for a refined parameter ⋮ Parameterized complexity of MaxSat above average ⋮ Solving min ones 2-SAT as fast as vertex cover ⋮ Hitting Selected (Odd) Cycles ⋮ Unnamed Item ⋮ On the parameterized vertex cover problem for graphs with perfect matching ⋮ On the parameterized complexity of vertex cover and edge cover with connectivity constraints ⋮ Unnamed Item ⋮ Balanced stable marriage: how close is close enough? ⋮ 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 ⋮ A characterization of König-Egerváry graphs with extendable vertex covers ⋮ Above guarantee parameterization for vertex cover on graphs with maximum degree 4

This page was built for publication: Paths, Flowers and Vertex Cover