Paths, Flowers and Vertex Cover

DOI10.1007/978-3-642-23719-5_33zbMATH Open1346.05287OpenAlexW87291490MaRDI QIDQ3092246FDOQ3092246

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

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

Cited In (17)

• Parameterized complexity of MaxSat above average
• Solving min ones 2-SAT as fast as vertex cover
• Rank Vertex Cover as a Natural Problem for Algebraic Compression
• Constraint Satisfaction Problems Parameterized above or below Tight Bounds: A Survey
• Above guarantee parameterization for vertex cover on graphs with maximum degree 4
• On the parameterized vertex cover problem for graphs with perfect matching
• A Randomized Polynomial Kernelization for Vertex Cover with a Smaller Parameter
• Title not available (Why is that?)
• Hitting Selected (Odd) Cycles
• New Algorithms for Edge Induced König-Egerváry Subgraph Based on Gallai-Edmonds Decomposition
• On Multiway Cut Parameterized above Lower Bounds
• Parameterized complexity of satisfying almost all linear equations over \(\mathbb F_2\)
• On the parameterized complexity of vertex cover and edge cover with connectivity constraints
• Balanced stable marriage: how close is close enough?
• Vertex cover kernelization revisited. Upper and lower bounds for a refined parameter
• A characterization of König-Egerváry graphs with extendable vertex covers
• Title not available (Why is that?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3092246)