# The Complexity of Satisfaction on Sparse Graphs

@inproceedings{Dawar2010TheCO, title={The Complexity of Satisfaction on Sparse Graphs}, author={Anuj Dawar}, booktitle={IPEC}, year={2010} }

We consider the complexity of deciding, given a graph G and a formula φ of first-order logic in the language of graphs, whether or not G ⊧ φ. In other words, we are interested in the complexity of the satisfaction relation for first-order logic on graphs. More particularly, we look at the complexity of this problem parameterized by the length of the formula φ. This problem (which is known to be AW[*]-complete) includes as special cases many important graph-theoretic problems, including…

## References

SHOWING 1-10 OF 10 REFERENCES

Deciding First-Order Properties for Sparse Graphs

- Mathematics2010 IEEE 51st Annual Symposium on Foundations of Computer Science
- 2010

An almost linear-time algorithm for deciding first-order logic (FOL) properties in classes of graphs with bounded expansion and a dynamic data structure for graphs belonging to a fixed class of graphs of bounded expansion for testing existential properties or the existence of short paths between prescribed vertices.

Domination Problems in Nowhere-Dense Classes of Graphs

- MathematicsArXiv
- 2009

It is shown that the distance-d dominating-set problem, also known as the (k,d)-centres problem, is fixed-parameter tractable on any class that is nowhere dense and closed under induced subgraphs.

Domination Problems in Nowhere-Dense Classes

- MathematicsFSTTCS
- 2009

It is shown that the distance-$d$ dominating-set problem, also known as the $(k,d)$-centres problem, is fixed-parameter tractable on any class that is nowhere dense and closed under induced subgraphs.

Linear time computable problems and first-order descriptions

- Mathematics, Computer ScienceMathematical Structures in Computer Science
- 1996

Using an old technique of Hanf and other techniques developed to prove the decidability of formal theories in mathematical logic, it is shown that an arbitrary FO-problem over relational structures of bounded degree can be solved in linear time.

Graph Rewriting: An Algebraic and Logic Approach

- Computer ScienceHandbook of Theoretical Computer Science, Volume B: Formal Models and Sematics
- 1990

First order properties on nowhere dense structures

- MathematicsThe Journal of Symbolic Logic
- 2010

It is shown that class with bounded expansion and (newly defined) classes with bounded local expansion and even (very general) nowhere dense classes are quasi wide and that any homomorphism closed first order definable property restricted to a bounded expansion class is a restricted duality.

Locally Excluding a Minor

- Mathematics, Computer Science22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007)
- 2007

It is shown that first-order model-checking is fixed-parameter tractable on any class of graphs locally excluding a minor and obtained fixed- Parameter algorithms for problems such as dominating or independent set on graph classes excluding aMinor.

Handbook Of Theoretical Computer Science Volume B Formal Models And Semantics

- Computer Science
- 1990

This topic is covered in the Handbook of Theoretical Computer Science, Volume B: Formal Models and Semantics, edited by J. Dershowitz and J.-P.