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

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)

Recommendations

• An improved fixed-parameter algorithm for vertex cover
• Improved Upper Bounds for Partial Vertex Cover
• Improved upper bounds for vertex cover
• Publication:4944990
• Vertex cover: Further observations and further improvements

Cited in

(9)

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