Graph-Theoretic Concepts in Computer Science

About this book

The collection of methods for classifying problems as fixed-parameter tractable, for designing FPT algorithms, for designing better FPT algorithms and transfer-ing these results to practical implementations, and for describing FPT problem transformations to prove lower bound and intractability results, has developed with surprising vigor  yet it still seems we are far from having the "basic vocabulary" of effective FPT algorithm design techniques worked out.