Faster decision of first-order graph properties
DOI10.1145/2603088.2603121zbMATH Open1394.68192OpenAlexW2083951446MaRDI QIDQ4635665FDOQ4635665
Publication date: 23 April 2018
Published in: Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2603088.2603121
Recommendations
- Testing first-order properties for subclasses of sparse graphs
- Completeness for first-order properties on sparse structures with algorithmic applications
- Completeness for first-order properties on sparse structures with algorithmic applications
- Deciding first-order properties of locally tree-decomposable structures
- Listing graphs that satisfy first-order sentences
Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Classical first-order logic (03B10)
Cited In (7)
- Approximately Counting and Sampling Small Witnesses Using a Colorful Decision Oracle
- Listing graphs that satisfy first-order sentences
- On the parameterized complexity of graph modification to first-order logic properties
- A fine-grained analogue of schaefer's Theorem in P: dichotomy of ∃k∀-quantified first-order graph properties
- Title not available (Why is that?)
- The fine-grained complexity of multi-dimensional ordering properties
- Counting Answers to Existential Questions
This page was built for publication: Faster decision of first-order graph properties
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4635665)
