On the fixed-parameter tractability of parameterized model-checking problems
In this note, we show, through the use of examples, how generic results for proving fixed-parameter tractability which apply to restricted classes of structures can sometimes be more widely applied. (c) 2007 Elsevier B.V. All rights reserved.
computational complexity analysis of algorithms fixed-pararneter tractability