无处稠密图类及算法应用。2019年逻辑，游戏和自动机亮点教程
Nowhere dense graph classes and algorithmic applications. A tutorial at Highlights of Logic, Games and Automata 2019
摘要：
无处稠密图类的概念是由Nešetzil和Ossona de Mendez提出的，它提供了一个鲁棒的图类一致稀疏的概念。无处密集类推广了许多熟悉的类的稀疏图，如类，排除一个固定的图作为一个小的或拓扑的小。他们承认几个看似无关的自然特征，导致强大的算法应用。特别是，一阶逻辑的模型检查问题是固定参数的这些类的易处理的。这些笔记是为2019年逻辑，游戏和自动机亮点的教程准备的，是对算法应用驱动的无处密集理论的简要介绍。
英文摘要：
The notion of nowhere dense graph classes was introduced by Nešetřil and Ossona de Mendez and provides a robust concept of uniform sparseness of graph classes. Nowhere dense classes generalize many familiar classes of sparse graphs such as classes that exclude a fixed graph as a minor or topological minor. They admit several seemingly unrelated natural characterizations that lead to strong algorithmic applications. In particular, the model-checking problem for first-order logic is fixed-parameter tractable over these classes. These notes, prepared for a tutorial at Highlights of Logic, Games and Automata 2019, are a brief introduction to the theory of nowhere denseness, driven by algorithmic applications.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
