Deterministic Parameterized Connected Vertex Cover
From MaRDI portal
Publication:2904546
DOI10.1007/978-3-642-31155-0_9zbMath1357.05143arXiv1202.6642OpenAlexW89448923MaRDI QIDQ2904546
Publication date: 14 August 2012
Published in: Algorithm Theory – SWAT 2012 (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1202.6642
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 (20)
A Multivariate Approach for Weighted FPT Algorithms ⋮ Parameterized Power Vertex Cover ⋮ A multivariate framework for weighted FPT algorithms ⋮ Reoptimization of parameterized problems ⋮ Enumeration and maximum number of minimal connected vertex covers in graphs ⋮ On the lossy kernelization for connected treedepth deletion set ⋮ Parameterized approximation via fidelity preserving transformations ⋮ \(p\)-edge/vertex-connected vertex cover: parameterized and approximation algorithms ⋮ Computing connected-\(k\)-subgraph cover with connectivity requirement ⋮ Circumventing connectivity for kernelization ⋮ Contracting graphs to paths and trees ⋮ On the parameterized complexity of vertex cover and edge cover with connectivity constraints ⋮ On the parameterized complexity of contraction to generalization of trees ⋮ Complexity of independency and cliquy trees ⋮ Approximation algorithms for connected maximum cut and related problems ⋮ Extension and its price for the connected vertex cover problem ⋮ Revisiting connected vertex cover: FPT algorithms and lossy kernels ⋮ On the Parameterized Complexity of Contraction to Generalization of Trees. ⋮ Parameterized complexity of multi-node hubs ⋮ Twin-width and polynomial kernels
This page was built for publication: Deterministic Parameterized Connected Vertex Cover
