A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
Nowhere dense graph classes and algorithmic applications. A tutorial at Highlights of Logic, Games and Automata 2019
[article]
2019
arXiv
pre-print
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
arXiv:1909.06752v1
fatcat:ced723x72bcqnkjldtrs6dkfgu