Kernels: Annotated, Proper and Induced

DOI10.1007/11847250_24zbMath1154.68559OpenAlexW1836728813MaRDI QIDQ3499744

Faisal N. Abu-Khzam, Henning Fernau

Publication date: 3 June 2008

Published in: Parameterized and Exact Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11847250_24

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) General topics in the theory of algorithms (68W01)

Related Items

Editing Graphs Into Few Cliques: Complexity, Approximation, and Kernelization Schemes, A top-down approach to search-trees: Improved algorithmics for 3-hitting set, Parameterized complexity of \(k\)-Chinese postman problem, A new bound for 3-satisfiable MaxSat and its algorithmic application, Meta-kernelization with structural parameters, Parameterized mixed graph coloring, Editing graphs to satisfy degree constraints: a parameterized approach, Breaking the \(2^{n}\)-barrier for irredundance: two lines of attack, A cubic-vertex kernel for flip consensus tree, Fixed parameter algorithms for one-sided crossing minimization revisited, A new lower bound on the maximum number of satisfied clauses in Max-SAT and its algorithmic applications, Fixed-parameter tractability results for feedback set problems in tournaments, Fixed-parameter algorithms for cluster vertex deletion, A kernelization algorithm for \(d\)-hitting set, Approximability of clique transversal in perfect graphs, Fixed-Parameter Algorithms for Cluster Vertex Deletion, A New Bound for 3-Satisfiable Maxsat and Its Algorithmic Application, Vertex and edge covers with clustering properties: Complexity and algorithms, A fast branching algorithm for cluster vertex deletion