Model Checking Lower Bounds for Simple Graphs
From MaRDI portal
Publication:5408193
DOI10.2168/LMCS-10(1:18)2014zbMath1326.68152MaRDI QIDQ5408193
Publication date: 9 April 2014
Published in: Logical Methods in Computer Science (Search for Journal in Brave)
Trees (05C05) Specification and verification (program logics, model checking, etc.) (68Q60) Structural characterization of families of graphs (05C75) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Model theory of finite structures (03C13)
Related Items (5)
Parameterized complexity of fair deletion problems ⋮ Grundy Distinguishes Treewidth from Pathwidth ⋮ Simplified algorithmic metatheorems beyond MSO: treewidth and neighborhood diversity ⋮ Unnamed Item ⋮ Unnamed Item
This page was built for publication: Model Checking Lower Bounds for Simple Graphs
