Intuitive Algorithms and t-Vertex Cover

DOI10.1007/11940128_60MaRDI QIDQ5459154zbMATH OpenOpenAlexFDO

Authors Joachim Kneis, Daniel Mölle, Stefan Richter, Peter Rossmanith

Publication date 24 April 2008

Published in Algorithms and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11940128_60

Mathematics Subject Classification ID

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

Recommendations

• An improved fixed-parameter algorithm for vertex cover
• Improved Upper Bounds for Partial Vertex Cover
• Improved upper bounds for vertex cover
• scientific article; zbMATH DE number 1420918
• Vertex cover: Further observations and further improvements

Cited in

(9)

• Subexponential algorithms for partial cover problems
• Twin-Cover: Beyond Vertex Cover in Parameterized Algorithmics
• Parameterized Algorithms for Partial Vertex Covers in Bipartite Graphs
• On the fixed-parameter tractability of the partial vertex cover problem with a matching constraint in edge-weighted bipartite graphs
• Improved Upper Bounds for Partial Vertex Cover
• Partial vertex cover and budgeted maximum coverage in bipartite graphs
• Further Exploiting c-Closure for FPT Algorithms and Kernels for Domination Problems
• On the partial vertex cover problem in bipartite graphs -- a parameterized perspective
• Implicit branching and parameterized partial cover problems

This page was built for publication: Intuitive Algorithms and t-Vertex Cover

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