scientific article
From MaRDI portal
Publication:3118384
zbMath1278.68099MaRDI QIDQ3118384
Martin Grohe, Stephan Kreutzer
Publication date: 2 March 2012
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
algorithmic meta-theoremsgraph classesfirst-order logic on graph classesmonadic second-order logic on graph classes
Analysis of algorithms and problem complexity (68Q25) Descriptive complexity and finite models (68Q19)
Related Items (20)
Compactors for parameterized counting problems ⋮ A Retrospective on (Meta) Kernelization ⋮ Quantified conjunctive queries on partially ordered sets ⋮ A Basic Parameterized Complexity Primer ⋮ Unnamed Item ⋮ Quantified Conjunctive Queries on Partially Ordered Sets ⋮ Parameterized extension complexity of independent set and related problems ⋮ Simplified algorithmic metatheorems beyond MSO: treewidth and neighborhood diversity ⋮ A Unified Approach to Structural Limits and Limits of Graphs with Bounded Tree-Depth ⋮ 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 ⋮ Polynomial bounds for centered colorings on proper minor-closed graph classes ⋮ Unnamed Item ⋮ On low rank-width colorings ⋮ Computations by fly-automata beyond monadic second-order logic ⋮ A distributed low tree-depth decomposition algorithm for bounded expansion classes ⋮ Unnamed Item
This page was built for publication:
