Scalable parallel algorithms for FPT problems
From MaRDI portal
Publication:2502279
Recommendations
Cited in
(17)- SCIP-Jack -- a solver for STP and variants with parallelization extensions
- Multivariate algorithmics for finding cohesive subnetworks
- Solving large FPT problems on coarse-grained parallel machines
- Computing hitting set kernels by \(\mathrm{AC}^0\)-circuits
- Efficient parallel algorithms for parameterized problems
- Lower bounds on paraclique density
- A basic parameterized complexity primer
- Scalable Parallel DFPN Search
- On the parameterized parallel complexity and the vertex cover problem
- scientific article; zbMATH DE number 4015931 (Why is no real title available?)
- Computing Hitting Set Kernels By AC^0-Circuits
- Fixed-parameter algorithms in analysis of heuristics for extracting networks in linear programs
- A SCALABLE PARALLEL ALGORITHM FOR TURNPIKE PROBLEM
- Towards work-efficient parallel parameterized algorithms
- Parameterized and Exact Computation
- Parallel FETI algorithms for mortars
- Vertex cover problem parameterized above and below tight bounds
This page was built for publication: Scalable parallel algorithms for FPT problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2502279)
