Intuitive Algorithms and t-Vertex Cover

DOI10.1007/11940128_60zbMath1135.68442OpenAlexW1491585824MaRDI QIDQ5459154

Joachim Kneis, Stefan Richter, Daniel Mölle, 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

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 (8)

Parameterized Algorithms for Partial Vertex Covers in Bipartite Graphs ⋮ 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 ⋮ Further Exploiting c-Closure for FPT Algorithms and Kernels for Domination Problems ⋮ On the partial vertex cover problem in bipartite graphs -- a parameterized perspective ⋮ Subexponential algorithms for partial cover problems ⋮ Implicit branching and parameterized partial cover problems ⋮ Partial Vertex Cover and Budgeted Maximum Coverage in Bipartite Graphs

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