On the parameterized parallel complexity and the vertex cover problem
Efficiently parallelizable parameterized problems have been classified as being either in the class FPP (fixed-parameter parallelizable) or the class PNC (parameterized analog of NC), which contains FPP as a subclass. In this paper, we propose a more restrictive class of parallelizable parameterized...
Saved in:
| Main Author: | |
|---|---|
| Other Authors: | , , , |
| Format: | conferenceObject |
| Published: |
2016
|
| Online Access: | http://hdl.handle.net/10725/7519 http://dx.doi.org/10.1007/978-3-319-48749-6 35 http://libraries.lau.edu.lb/research/laur/terms-of-use/articles.php https://link.springer.com/chapter/10.1007%2F978-3-319-48749-6_35 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|