A Note on Vertex Cover in Graphs with Maximum Degree 3
From MaRDI portal
Publication:3578312
DOI10.1007/978-3-642-14031-0_18zbMath1286.05173OpenAlexW1512948791MaRDI QIDQ3578312
Publication date: 20 July 2010
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-14031-0_18
Analysis of algorithms (68W40) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (9)
Maximum Minimal Vertex Cover Parameterized by Vertex Cover ⋮ On a generalization of Nemhauser and Trotter's local optimization theorem ⋮ A multivariate framework for weighted FPT algorithms ⋮ Parameterized edge dominating set in graphs with degree bounded by 3 ⋮ Maximum Minimal Vertex Cover Parameterized by Vertex Cover ⋮ A novel parameterised approximation algorithm for \textsc{minimum vertex cover} ⋮ An exact algorithm for maximum independent set in degree-5 graphs ⋮ Parameterized Edge Dominating Set in Cubic Graphs ⋮ Above guarantee parameterization for vertex cover on graphs with maximum degree 4
This page was built for publication: A Note on Vertex Cover in Graphs with Maximum Degree 3
