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

DOI10.1016/j.ipl.2007.09.009zbMath1186.68303OpenAlexW2084107093MaRDI QIDQ963328

Iain A. Stewart

Publication date: 19 April 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: http://dro.dur.ac.uk/5744/1/5744.pdf

zbMATH Keywords

computational complexityanalysis of algorithmsfixed-parameter tractability

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (4)

Fixed-parameter tractable distances to sparse graph classes ⋮ Editing graphs to satisfy degree constraints: a parameterized approach ⋮ On the treewidth of dynamic graphs ⋮ Parameterized Graph Editing with Chosen Vertex Degrees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Parametrized complexity theory.
• Fixed-Parameter Tractability, Definability, and Model-Checking
• Deciding first-order properties of locally tree-decomposable structures

This page was built for publication: On the fixed-parameter tractability of parameterized model-checking problems