Towards work-efficient parallel parameterized algorithms

DOI10.1007/978-3-030-10564-8_27MaRDI QIDQ5236174zbMATH OpenOpenAlexFDO

Authors Max Bannach, Malte Skambath, Till Tantau

Publication date 15 October 2019

Published in WALCOM: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1902.07660

zbMATH Keywords

fixed-parameter tractabilityparallel computationwork efficiency

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Recommendations

• Efficient parallel algorithms for parameterized problems
• Fast parallel fixed-parameter algorithms via color coding
• Computing kernels in parallel: lower and upper bounds
• Solving large FPT problems on coarse-grained parallel machines
• Scalable parallel algorithms for FPT problems

Cited in

(7)

• Solving large FPT problems on coarse-grained parallel machines
• Efficient parallel algorithms for parameterized problems
• Scalable parallel algorithms for FPT problems
• On the parameterized parallel complexity and the vertex cover problem
• Computing kernels in parallel: lower and upper bounds
• Fast parallel fixed-parameter algorithms via color coding
• Parameterized complexity of d-hitting set with quotas

This page was built for publication: Towards work-efficient parallel parameterized algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5236174)