Enumeration for FO Queries over Nowhere Dense Graphs
From MaRDI portal
Publication:5889796
DOI10.1145/3517035OpenAlexW4300618478MaRDI QIDQ5889796FDOQ5889796
Authors: Nicole Schweikardt, Luc Segoufin, Alexandre Vigny 
Publication date: 27 April 2023
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/3517035
Recommendations
Cites Work
- Title not available (Why is that?)
- Elements of finite model theory.
- On Acyclic Conjunctive Queries and Constant Delay Enumeration
- Title not available (Why is that?)
- First-order queries on structures of bounded degree are computable with constant delay
- Deciding first-order properties of locally tree-decomposable structures
- Domination problems in nowhere-dense classes of graphs
- The complexity of first-order and monadic second-order logic revisited
- On nowhere dense graphs
- First order properties on nowhere dense structures
- The succinctness of first-order logic on linear orders
- Title not available (Why is that?)
- Storing a sparse table
- Title not available (Why is that?)
- Title not available (Why is that?)
- Generalized model-checking over locally tree-decomposable classes
- Constant delay enumeration for FO queries over databases with local bounded expansion
- Enumeration of monadic second-order queries on trees
- MSO Queries on Tree Decomposable Structures Are Computable with Linear Delay
- Enumerating answers to first-order queries over databases of low degree
- Title not available (Why is that?)
- Answering UCQs under updates and in the presence of integrity constraints
- Answering FO+MOD queries under updates on bounded degree databases
- Enumeration for FO Queries over Nowhere Dense Graphs
Cited In (4)
This page was built for publication: Enumeration for FO Queries over Nowhere Dense Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5889796)
