Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

9

IPL
2008

favoriteEmaildiscussreport

65views more IPL 2008»

On the fixed-parameter tractability of parameterized model-checking problems

13 years 4 months ago

On the fixed-parameter tractability of parameterized model-checking problems

Download www.dur.ac.uk

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

Iain A. Stewart

Real-time Traffic

Fixed-parameter Tractability | IPL 2008 | Key Words | Tractability 1991 Msc |

claim paper

Related Content

» Subexponential Time and FixedParameter Tractability Exploiting the Miniaturization Mapping

» FixedParameter Tractability of Anonymizing Data by Suppressing Entries

» FixedParameter Hierarchies inside PSPACE

» FixedParameter Algorithms for Protein Similarity Search Under mRNA Structure Constraints

» FixedParameter Algorithms for the k rCenter in Planar Graphs and Map Graphs

» FixedParameter Algorithms for Cochromatic Number and Disjoint Rectangle Stabbing

» Fixedparameter tractability definability and model checking

» Reflections on Multivariate Algorithmics and Problem Parameterization

» Intractability of CliqueWidth Parameterizations

» Parameterized Complexity of the Clique Partition Problem

Post Info
More Details (n/a)

Added	12 Dec 2010
Updated	12 Dec 2010
Type	Journal
Year	2008
Where	IPL
Authors	Iain A. Stewart

Comments (0)