Scalable parallel algorithms for FPT problems
From MaRDI portal
Publication:2502279
DOI10.1007/s00453-006-1214-1zbMath1097.68671OpenAlexW2020681752MaRDI QIDQ2502279
Michael A. Langston, Pushkar Shanbhag, Faisal N. Abu-Khzam, Christopher T. Symons
Publication date: 12 September 2006
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-006-1214-1
Related Items (8)
Lower bounds on paraclique density ⋮ A Basic Parameterized Complexity Primer ⋮ Computing Hitting Set Kernels By AC^0-Circuits ⋮ Vertex cover problem parameterized above and below tight bounds ⋮ Multivariate algorithmics for finding cohesive subnetworks ⋮ Computing hitting set kernels by \(\mathrm{AC}^0\)-circuits ⋮ Efficient parallel algorithms for parameterized problems ⋮ Fixed-Parameter Algorithms in Analysis of Heuristics for Extracting Networks in Linear Programs
Uses Software
This page was built for publication: Scalable parallel algorithms for FPT problems
