scientific article; zbMATH DE number 6784972
From MaRDI portal
Publication:5363777
DOI10.4230/LIPIcs.IPEC.2015.224zbMath1378.68189arXiv1509.06984MaRDI QIDQ5363777
Christoph Stockhusen, Max Bannach, Till Tantau
Publication date: 29 September 2017
Full work available at URL: https://arxiv.org/abs/1509.06984
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
parallel computationmodel checkingcluster editingfixed-parameter tractabilitytree-widthtree-depthgraph packingcolor codingcutting \(\ell\) vertices
Analysis of algorithms and problem complexity (68Q25) Parallel algorithms in computer science (68W10)
Related Items
Parameterized Parallel Computing and First-Order Logic ⋮ Unnamed Item ⋮ Computing Hitting Set Kernels By AC^0-Circuits ⋮ Some lower bounds in parameterized \(\mathrm{AC}^{0}\) ⋮ Serial and parallel kernelization of multiple hitting set parameterized by the Dilworth number, implemented on the GPU ⋮ Parameterised counting in logspace ⋮ Unnamed Item ⋮ Computing hitting set kernels by \(\mathrm{AC}^0\)-circuits ⋮ On the Descriptive Complexity of Color Coding ⋮ Efficient parallel algorithms for parameterized problems
