Parameterized Complexity

  • R. G. Downey
  • M. R. Fellows
Part of the Monographs in Computer Science book series (MCS)

Table of contents

  1. Front Matter
    Pages i-xv
  2. Computers, Complexity, and Intractability from the Parametric Point of View

  3. Parameterized Tractability

    1. Front Matter
      Pages 21-21
    2. R. G. Downey, M. R. Fellows
      Pages 23-28
    3. R. G. Downey, M. R. Fellows
      Pages 61-66
    4. R. G. Downey, M. R. Fellows
      Pages 67-142
    5. R. G. Downey, M. R. Fellows
      Pages 143-209
    6. R. G. Downey, M. R. Fellows
      Pages 211-223
  4. Parameterized Intractability

    1. Front Matter
      Pages 225-225
    2. R. G. Downey, M. R. Fellows
      Pages 227-234
    3. R. G. Downey, M. R. Fellows
      Pages 235-254
    4. R. G. Downey, M. R. Fellows
      Pages 255-281
    5. R. G. Downey, M. R. Fellows
      Pages 283-313
    6. R. G. Downey, M. R. Fellows
      Pages 315-330
    7. R. G. Downey, M. R. Fellows
      Pages 331-340
    8. R. G. Downey, M. R. Fellows
      Pages 341-350
  5. Structural and Other Results

    1. Front Matter
      Pages 351-351

About this book

Introduction

The idea for this book was conceived over the second bottle of Villa Maria's Caber­ net Medot '89, at the dinner of the Australasian Combinatorics Conference held at Palmerston North, New Zealand in December 1990, where the authors first met and discovered they had a number of interests in common. Initially, we embarked on a small project to try to formulate reductions to address the apparent parame­ terized intractability of DOMINATING SET, and to introduce a structure in which to frame our answers. Having spent several months trying to get the definitions for the reductions right (they now seem so obvious), we turned to our tattered copies of Garey and Johnson's work [239]. We were stunned to find that virtually none of the classical reductions worked in the parameterized setting. We then wondered if we'd be able to find any interesting reductions. Several years, many more bottles, so many papers, and reductions later it [3] seemed that we had unwittingly stumbled upon what we believe is a truly central and new area of complexity theory. It seemed to us that the material would be of great interest to people working in areas where exact algorithms for a small range of parameters are natural and useful (e. g. , Molecular Biology, VLSI design). The tractability theory was rich with distinctive and powerful techniques. The intractability theory seemed to have a deep structure and techniques all of its own.

Keywords

Algorithms Automat Graph algorithm automata classification complexity complexity theory optimization

Authors and affiliations

  • R. G. Downey
    • 1
  • M. R. Fellows
    • 2
  1. 1.Department of MathematicsVictoria University, WellingtonWellingtonNew Zealand
  2. 2.Department of Computer ScienceUniversity of Victoria, VictoriaVictoriaCanada

Bibliographic information

  • DOI https://doi.org/10.1007/978-1-4612-0515-9
  • Copyright Information Springer-Verlag New York, Inc. 1999
  • Publisher Name Springer, New York, NY
  • eBook Packages Springer Book Archive
  • Print ISBN 978-1-4612-6798-0
  • Online ISBN 978-1-4612-0515-9
  • Series Print ISSN 0172-603X
  • About this book