Abstract
We introduce a framework to study the parallel complexity of parameterized problems, and we propose some analogs of NC.
Chapter PDF
References
Stefan Arnborg, Jens Lagergren, and Detlef Seese. Easy problems for treedecomposable graphs. Journal of Algorithms, 12, 308–340, 1991.
Hans L. Bodlaender. A partial k-arboretum of graphs with bounded treewidth. Technical Report, Department of Computer Science, Utrecht University, 1995.
Hans L. Bodlaender, Rodney G. Downey, and Michael R. Fellows. Applications of parameterized complexity to problems of parallel and distributed computation, 1994. Unpublished extended abstract.
Hans L. Bodlaender and Torben Hagerup. Parallel algorithms with optimal speedup for bounded treewidth. Technical Report UU-CS-1995-25, Department of Computer Science, Utrecht University, 1995.
A. K. Chandra, D. C. Kozen, and L. J. Stockmeyer. Alternation. J. of the ACM, 28, 114–133, 1981.
Rodney G. Downey and Michael R. Fellows. Parameterized computational feasibility. Feasible Mathematics II, 219–244. Birkhäuser, Boston, 1994.
Rodney G. Downey and Michael R. Fellows. Fixed-parameter tractability and completeness II: On completeness for W[1]. TCS, 141, 109–131, 1995.
Michael R. Garey and Davis S. Johnson. Computers and Intractability — A Guide to the Theory of NP-Completeness. W. H. Freeman and Co., New York, 1979.
Neil Robertson and Paul D. Seymour. Graph Minors. II. Algorithmic aspects of tree-width. Journal of Algorithms, 7, 309–322, 1986.
Larry Stockmeyer and Uzi Vishkin. Simulation of parallel random access machines by circuits. SIAM J. Comput., 13(2), 409–422, 1984.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cesati, M., Di Ianni, M. (1998). Parameterized parallel complexity. In: Pritchard, D., Reeve, J. (eds) Euro-Par’98 Parallel Processing. Euro-Par 1998. Lecture Notes in Computer Science, vol 1470. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0057945
Download citation
DOI: https://doi.org/10.1007/BFb0057945
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64952-6
Online ISBN: 978-3-540-49920-6
eBook Packages: Springer Book Archive