The Parameterized Complexity of Domination-Type Problems and Application to Linear Codes
From MaRDI portal
Publication:5410637
DOI10.1007/978-3-319-06089-7_7zbMath1405.68134arXiv1209.5267OpenAlexW1631436345MaRDI QIDQ5410637
Publication date: 16 April 2014
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1209.5267
Analysis of algorithms and problem complexity (68Q25) Linear codes (general theory) (94B05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (5)
A new approach on locally checkable problems ⋮ Linear kernels for \(k\)-tuple and liar's domination in bounded genus graphs ⋮ Not-all-equal and 1-in-degree decompositions: algorithmic complexity and applications ⋮ New algorithms for weighted \(k\)-domination and total \(k\)-domination problems in proper interval graphs ⋮ A complete parameterized complexity analysis of bounded planning
This page was built for publication: The Parameterized Complexity of Domination-Type Problems and Application to Linear Codes
