Deciding First-Order Properties for Sparse Graphs

Abstract

We present a linear-time algorithm for deciding first-order logic (FOL) properties in classes of graphs with bounded expansion. 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 sub graph isomorphic to a subdivision of a fixed graph, and… (More)
DOI: 10.1109/FOCS.2010.20

Topics

Statistics

0102030201020112012201320142015201620172018
Citations per Year

71 Citations

Semantic Scholar estimates that this publication has 71 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@article{Dvorak2010DecidingFP, title={Deciding First-Order Properties for Sparse Graphs}, author={Zdenek Dvorak and Daniel Kr{\'a}l and Robin Thomas}, journal={2010 IEEE 51st Annual Symposium on Foundations of Computer Science}, year={2010}, pages={133-142} }