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. Key words: computational complexity, analysis of algorithms, fixed-parameter tractability 1991 MSC: 68Q15

• Type: Journal
• Year: 2008
• Where: IPL
• Authors: Iain A. Stewart
• Keywords: Fixed-parameter Tractability, IPL 2008, Key Words, Tractability 1991 Msc