Parameterized parallel complexity

  • Marco Cesati
  • Miriam Di Ianni
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1470)


We introduce a framework to study the parallel complexity of parameterized problems, and we propose some analogs of NC.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Stefan Arnborg, Jens Lagergren, and Detlef Seese. Easy problems for treedecomposable graphs. Journal of Algorithms, 12, 308–340, 1991.MATHMathSciNetCrossRefGoogle Scholar
  2. 2.
    Hans L. Bodlaender. A partial k-arboretum of graphs with bounded treewidth. Technical Report, Department of Computer Science, Utrecht University, 1995.Google Scholar
  3. 3.
    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.Google Scholar
  4. 4.
    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.Google Scholar
  5. 5.
    A. K. Chandra, D. C. Kozen, and L. J. Stockmeyer. Alternation. J. of the ACM, 28, 114–133, 1981.MATHMathSciNetCrossRefGoogle Scholar
  6. 6.
    Rodney G. Downey and Michael R. Fellows. Parameterized computational feasibility. Feasible Mathematics II, 219–244. Birkhäuser, Boston, 1994.Google Scholar
  7. 7.
    Rodney G. Downey and Michael R. Fellows. Fixed-parameter tractability and completeness II: On completeness for W[1]. TCS, 141, 109–131, 1995.MATHMathSciNetCrossRefGoogle Scholar
  8. 8.
    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.Google Scholar
  9. 9.
    Neil Robertson and Paul D. Seymour. Graph Minors. II. Algorithmic aspects of tree-width. Journal of Algorithms, 7, 309–322, 1986.MATHMathSciNetCrossRefGoogle Scholar
  10. 10.
    Larry Stockmeyer and Uzi Vishkin. Simulation of parallel random access machines by circuits. SIAM J. Comput., 13(2), 409–422, 1984.MATHMathSciNetCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • Marco Cesati
    • 1
  • Miriam Di Ianni
    • 2
  1. 1.Dip. di Informatica, Sistemi e ProduzioneUniv. “Tor Vergata”RomaItaly
  2. 2.Istituto di ElettronicaUniversité di PerugiaPerugiaItaly

Personalised recommendations