Solving large FPT problems on coarse-grained parallel machines
- 31 December 2003
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 67 (4), 691-706
- https://doi.org/10.1016/s0022-0000(03)00075-8
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- A NOTE ON COARSE GRAINED PARALLEL INTEGER SORTINGParallel Processing Letters, 1999
- Parameterized complexity: A framework for systematically confronting computational intractabilityPublished by American Mathematical Society (AMS) ,1999
- Vertex Cover: Further Observations and Further ImprovementsLecture Notes in Computer Science, 1999
- Upper Bounds for Vertex Cover Further ImprovedLecture Notes in Computer Science, 1999
- An improved fixed-parameter algorithm for vertex coverInformation Processing Letters, 1998
- Parameterized parallel complexityPublished by Springer Nature ,1998
- SCALABLE PARALLEL COMPUTATIONAL GEOMETRY FOR COARSE GRAINED MULTICOMPUTERSInternational Journal of Computational Geometry & Applications, 1996
- Fixed-Parameter Tractability and Completeness I: Basic ResultsSIAM Journal on Computing, 1995
- Fixed-parameter tractability and completeness II: On completeness for W[1]Theoretical Computer Science, 1995
- Nondeterminism within $P^ * $SIAM Journal on Computing, 1993