Fast parallel fixed-parameter algorithms via color coding
From MaRDI portal
Recommendations
Cited in
(17)- Computing hitting set kernels by \(\mathrm{AC}^0\)-circuits
- Efficient parallel algorithms for parameterized problems
- Parameterised counting in logspace
- Parameterised counting in logspace
- Computing Hitting Set Kernels By AC^0-Circuits
- Towards work-efficient parallel parameterized algorithms
- On the parallel parameterized complexity of MaxSAT variants
- The parameterized space complexity of model-checking bounded variable first-order logic
- On the descriptive complexity of color coding
- Serial and parallel kernelization of multiple hitting set parameterized by the Dilworth number, implemented on the GPU
- Space-efficient graph kernelizations
- Computing kernels in parallel: lower and upper bounds
- Parameterized Parallel Computing and First-Order Logic
- Algorithm engineering for color-coding with applications to signaling pathway detection
- Some lower bounds in parameterized \(\mathrm{AC}^{0}\)
- Existential second-order logic over graphs: parameterized complexity
- scientific article; zbMATH DE number 3935077 (Why is no real title available?)
This page was built for publication: Fast parallel fixed-parameter algorithms via color coding
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5363777)
