The monadic second-order logic of graphs. I. recognizable sets of finite graphs
Information and Computation
Graph minors. XIII: the disjoint paths problem
Journal of Combinatorial Theory Series B
Fixed-parameter tractability and completeness II: on completeness for W[1]
Theoretical Computer Science
Subgraph isomorphism in planar graphs and related problems
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Deciding first-order properties of locally tree-decomposable structures
Journal of the ACM (JACM)
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Linear time low tree-width partitions and algorithmic consequences
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
LICS '07 Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science
On the Maximum Number of Cliques in a Graph
Graphs and Combinatorics
Grad and classes with bounded expansion I. Decompositions
European Journal of Combinatorics
Grad and classes with bounded expansion II. Algorithmic aspects
European Journal of Combinatorics
Grad and classes with bounded expansion III. Restricted graph homomorphism dualities
European Journal of Combinatorics
Coloring triangle-free graphs on surfaces
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Building Bridges: Between Mathematics and Computer Science (Bolyai Society Mathematical Studies)
Building Bridges: Between Mathematics and Computer Science (Bolyai Society Mathematical Studies)
Algorithms for Classes of Graphs with Bounded Expansion
Graph-Theoretic Concepts in Computer Science
IWPEC'08 Proceedings of the 3rd international conference on Parameterized and exact computation
Deciding First-Order Properties for Sparse Graphs
FOCS '10 Proceedings of the 2010 IEEE 51st Annual Symposium on Foundations of Computer Science
European Journal of Combinatorics
Characterisations and examples of graph classes with bounded expansion
European Journal of Combinatorics
Parameterized Complexity
Hi-index | 0.00 |
We present a linear-time algorithm for deciding first-order (FO) properties in classes of graphs with bounded expansion, a notion recently introduced by Nešetřil and Ossona de Mendez. This generalizes several results from the literature, because many natural classes of graphs have bounded expansion: graphs of bounded tree-width, all proper minor-closed classes of graphs, graphs of bounded degree, graphs with no subgraph isomorphic to a subdivision of a fixed graph, and graphs that can be drawn in a fixed surface in such a way that each edge crosses at most a constant number of other edges. We deduce that there is an almost linear-time algorithm for deciding FO properties in classes of graphs with locally bounded expansion. More generally, we design a dynamic data structure for graphs belonging to a fixed class of graphs of bounded expansion. After a linear-time initialization the data structure allows us to test an FO property in constant time, and the data structure can be updated in constant time after addition/deletion of an edge, provided the list of possible edges to be added is known in advance and their simultaneous addition results in a graph in the class. All our results also hold for relational structures and are based on the seminal result of Nešetřil and Ossona de Mendez on the existence of low tree-depth colorings.