# Towards Work-Efficient Parallel Parameterized Algorithms

## TL;DR

This paper explores how to design work-efficient parallel fixed-parameter tractable algorithms, balancing theoretical speed with practical efficiency on limited processor counts, by analyzing standard fpt methods.

## Contribution

It introduces a framework for creating work-efficient parallel fpt algorithms by analyzing trade-offs in kernelization, search trees, and interleaving methods.

## Key findings

- Proves trade-offs between work efficiency and runtime improvements.
- Develops a toolbox for designing work-efficient parallel fpt algorithms.
- Analyzes standard fpt techniques for parallelization efficiency.

## Abstract

Parallel parameterized complexity theory studies how fixed-parameter tractable (fpt) problems can be solved in parallel. Previous theoretical work focused on parallel algorithms that are very fast in principle, but did not take into account that when we only have a small number of processors (between 2 and, say, 1024), it is more important that the parallel algorithms are work-efficient. In the present paper we investigate how work-efficient fpt algorithms can be designed. We review standard methods from fpt theory, like kernelization, search trees, and interleaving, and prove trade-offs for them between work efficiency and runtime improvements. This results in a toolbox for developing work-efficient parallel fpt algorithms.