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

DOI10.1016/J.IPL.2007.09.009zbMATH Open1186.68303OpenAlexW2084107093MaRDI QIDQ963328FDOQ963328

Iain 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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Parametrized complexity theory.
• Deciding first-order properties of locally tree-decomposable structures
• Fixed-parameter tractability, definability, and model-checking

Cited In (5)

• Attacking the Dimensionality Problem of Parameterized Systems via Bounded Reachability Graphs
• Parameterized Graph Editing with Chosen Vertex Degrees
• Fixed-parameter tractable distances to sparse graph classes
• Editing graphs to satisfy degree constraints: a parameterized approach
• On the treewidth of dynamic graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q963328)