Solving large FPT problems on coarse-grained parallel machines

Journal of Computer and System Sciences

Volumn 67, Issue 4, 2003, Pages 691-706

  Cheetham, James ^a   Dehne, Frank ^b   Rau Chaplin, Andrew ^c   Stege, Ulrike ^d   Taillon, Peter J ^b  

^a CARLETON UNIVERSITY   (Canada)

^b CARLETON UNIVERSITY   (Canada)

^c DALHOUSIE UNIVERSITY   (Canada)

^d UNIVERSITY OF VICTORIA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

BIOCHEMISTRY; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; DATA STRUCTURES; GRAPH THEORY; PARALLEL PROCESSING SYSTEMS;

COARSE-GRAINED PARALLEL MACHINES; COMPUTATIONAL BIOCHEMISTRY; FIXED-PARAMETER TRACTABILITY PROBLEM;

ALGORITHMS;

EID: 0346361605     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0022-0000(03)00075-8     Document Type: Article

References (27)

1. R. Balasubramanian, M.R. Fellows, V. Raman, An improved fixed-parameter algorithms for vertex cover, Inform. Process. Lett. 65 (1998) 163-168.
2. D.J. Becker, T. Sterling, D. Savarese, J.E. Dorband, U.A. Ranawak, C.V. Packer, Beowulf: a parallel workstation for scientific computation, in: Proceedings of the International Conference on Parallel Processing, Oconomowoc, WI, 1995, pp. I: 11-14.
3. H.L. Bodlaender, R.G. Downey, M.R. Fellows, Applications of parameterized complexity to problems of parallel and distributed computation, Unpublished extended abstract, 1994.
4. J.F. Buss, J. Goldsmith, Nondeterminism within P, SIAM J. Comput. 22 (1993) 560-572.
5. M. Cesati, M. Di Ianni, Parameterized parallel complexity, in: Proceedings of the Fourth International Euro-Par Conference, Southampton, UK, 1998, pp. 892-896.
6. A. Chan, F. Dehne, A note on coarse-grained parallel integer sorting, in: Proceedings of the 13th Annual International Symposium on High Performance Computers (HPCS'99), Kingston, Canada, 1999, pp. 261-267.
7. J. Chen, I.A. Kanj, W. Jia, Vertex cover: further observations and further improvements, in: P. Widmayer, G. Neyer, S. Eidenbenz (Eds.), 25th International Workshop on Graph-Theoretical Concepts in Computer Science (WG'99), LNCS, Springer, Berlin, 1999.
8. F. Dehne, Guest editor's introduction, (special issue on Coarse grained parallel algorithms), Algorithmica 24 (3/4) (1999) 173-176.
9. F. Dehne, A. Fabri, A. Rau-Chaplin, Scalable parallel computational geometry for coarse grained multicomputers, Internat. J. Comput. Geom. 6 (3) (1996) 379-400.
10. L. DeVroye, Private communication, GRACO Conference, Fortaleza, Brazil, March 2001.
11. R.G. Downey, M.R. Fellows, Fixed-parameter tractability and completeness, Congr. Numer. 87 (1992) 161-187.
12. R.G. Downey, M.R. Fellows, Fixed parameter tractability and completeness I: basic theory, SIAM J. Comput. 24 (1995) 873-921.
13. R.G. Downey, M.R. Fellows, Fixed parameter tractability and completeness II: completeness for W[1], Theoret. Comput. Sci. A 141 (1995) 109-131.
14. R.G. Downey, M.R. Fellows, Parameterized computational feasibility, in: P. Clote, J. Remmel (Eds.), Feasible Mathematics II, Birkhauser, Boston, 1995, pp. 219-244.
15. R.G. Downey, M.R. Fellows, Parameterized Complexity, Springer, Berlin, 1998.
16. R.G. Downey, M.R. Fellows, U. Stege, Parameterized complexity: a framework for systematically confronting computational intractability, in: F. Roberts, J. Kratochvil, J. Nesetril (Eds.), Contemporary Trends in Discrete Mathematics: From DIMACS and DIMATIA to the Future, AMS-DIMACS Proceedings Series, Vol. 49, Amer. Math. Soc. Providence, RI, 1999, pp. 49-99.
17. M.R. Fellows, On the complexity of vertex set problems, Technical Report, Computer Science Department, University of New Mexico, 1988.
18. M. Garey, D. Johnson, Computers and Intractability: A Guide to the Theory of NP-completeness, Freeman, New York, 1979.
19. G. Gonnet, Vertex cover approximation algorithm, http://cbrg.inf.ethz.ch/Server/VertexCover.html, 1999.
20. R. Niedermeier, P. Rossmanith, Upper bounds for vertex cover further improved, in: C. Meinel, S. Tison (Eds.), Proceedings of the 16th Symposium on Theoretical Aspects in Computer Science (STACS'99), LNCS, Springer, New York, 1999.
21. C.H. Papadimitriou, M. Yannakakis, On limited nondeterminism and the complexity of the V-C dimension, J. Comput. System Sci. 53 (1996) 161-170.
22. V.N. Rao, V. Kumar, On the efficiency of parallel backtracking, IEEE Trans. Parallel Distrib. Systems 4 (4) (1993) 427-437.
23. C. Roth-Korostensky, Algorithms for building multiple sequence alignments and evolutionary trees, Ph.D. Thesis, ETH Zürich, Institute of Scientific Computing, February 2000.
24. U. Stege, M.R. Fellows, An improved fixed-parameter-tractable algorithm for Vertex Cover, Technical Report 318, Department of Computer Science, ETH Zürich, April 1999.
25. U. Stege, Resolving conflicts from problems in computational biology, Ph.D. Thesis, No.13364, ETH Zürich, 2000.
26. J.D. Thompson, D.G. Higgins, T.J. Gibson, CLUSTAL W: Improving the sensitivity of progressive multiple sequence alignment through sequence weighting, positions-specific gap penalties and weight matrix choice, Nucleic Acids Res. 22 (1994) 4673-4680.
27. L. Valiant, A bridging model for parallel computation, Comm. ACM 33 (8) (1990) 103-111.