Model checking on interpretations of classes of bounded local cliquewidth
From MaRDI portal
Cites work
- A Guide to NIP Theories
- Algorithmic meta-theorems
- Approximating clique-width and branch-width
- Bounded VC-dimension implies a fractional Helly theorem
- Classes of graphs with low complexity: the case of classes with bounded linear rankwidth
- Computing roots of graphs is hard
- Deciding first-order properties of locally tree-decomposable structures
- Directed Nowhere Dense Classes of Graphs
- First-order interpretations of bounded expansion classes
- Fixed-parameter tractability, definability, and model-checking
- Graph structure and monadic second-order logic. A language-theoretic approach
- scientific article; zbMATH DE number 3819693 (Why is no real title available?)
- scientific article; zbMATH DE number 969067 (Why is no real title available?)
- Interpreting nowhere dense graph classes as a classical notion of model theory
- Learnability and definability in trees and similar structures
- Linear rankwidth meets stability
- Linear time solvable optimization problems on graphs of bounded clique-width
- Lower bounds on the complexity of \(\mathsf{MSO}_1\) model-checking
- Recognizability, hypergraph operations, and logical types
- Second-order quantifiers and the complexity of theories
- Stability, the f.c.p., and superstability; model theoretic properties of formulas in first order theory
- Stable graphs
- The complexity of homomorphism and constraint satisfaction problems seen from the other side
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- Twin-width II: small classes
- Twin-width. I: Tractable FO model checking
Cited in
(5)- On classes of bounded tree rank, their interpretations, and efficient sparsification
- Parameterized algorithms for coordinated motion planning: minimizing energy
- Elementary first-order model checking for sparse graphs
- Compound logics for modification problems
- Advances in algorithmic meta theorems (invited paper)
This page was built for publication: Model checking on interpretations of classes of bounded local cliquewidth
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6649489)
