Affiliation:
1. Charles University in Prague, Czech Republic
2. University of Warwick, United Kingdom
3. Georgia Institute of Technology, Atlanta, GA
Abstract
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.
Funder
Seventh Framework Programme
project 1M0545 of Ministry of Education of Czech Republic
Division of Mathematical Sciences
Publisher
Association for Computing Machinery (ACM)
Subject
Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software
Cited by
54 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Discrepancy and sparsity;Journal of Combinatorial Theory, Series B;2024-11
2. Elementary first-order model checking for sparse graphs;Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science;2024-07-08
3. Twin-Width IV: Ordered Graphs and Matrices;Journal of the ACM;2024-06-13
4. Flip-Breakability: A Combinatorial Dichotomy for Monadically Dependent Graph Classes;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10
5. Elimination Distance to Bounded Degree on Planar Graphs Preprint;Fundamenta Informaticae;2024-05-31