Parameterized Parallel Complexity


We consider the framework of Parameterized Complexity and we investigate the issue of which problems do admit eecient xed parameter parallel algorithms. In particular, we introduce two classes of eeciently parallelizable parameterized problems, PNC and FPP, according to the degree of eeciency we want to obtain. We sketch both some FPP-algorithms solving… (More)
DOI: 10.1007/BFb0057945


Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Slides referencing similar topics