scientific article
From MaRDI portal
Publication:3172385
zbMath1262.03058MaRDI QIDQ3172385
Publication date: 5 October 2011
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Automata and formal grammars in connection with logical questions (03D05) Decidability of theories and sets of sentences (03B25) Graph minors (05C83) Model theory of finite structures (03C13) General topics in the theory of algorithms (68W01)
Related Items (16)
On ultralimits of sparse graph classes ⋮ Coloring and Covering Nowhere Dense Graphs ⋮ Lower bounds on the complexity of \(\mathsf{MSO}_1\) model-checking ⋮ Grouped domination parameterized by vertex cover, twin cover, and beyond ⋮ Large Induced Subgraphs via Triangulations and CMSO ⋮ Grouped domination parameterized by vertex cover, twin cover, and beyond ⋮ Unnamed Item ⋮ Extended MSO model checking via small vertex integrity ⋮ Unnamed Item ⋮ Practical algorithms for MSO model-checking on tree-decomposable graphs ⋮ A gentle introduction to applications of algorithmic metatheorems for space and circuit classes ⋮ On the weak 2-coloring number of planar graphs ⋮ Computations by fly-automata beyond monadic second-order logic ⋮ The Complexity of Decomposing Modal and First-Order Theories ⋮ Colouring and Covering Nowhere Dense Graphs ⋮ On the Parameterised Intractability of Monadic Second-Order Logic
This page was built for publication:
