Faster decision of first-order graph properties
From MaRDI portal
Publication:4635665
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
Cited in
(9)- Counting Answers to Existential Questions
- 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
- Completeness for first-order properties on sparse structures with algorithmic applications
- scientific article; zbMATH DE number 6866317 (Why is no real title available?)
- Completeness for first-order properties on sparse structures with algorithmic applications
- The fine-grained complexity of multi-dimensional ordering properties
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)