MSO Queries on Tree Decomposable Structures Are Computable with Linear Delay
From MaRDI portal
Recommendations
Cited in
(25)- Compact representation for answer sets of n-ary regular queries
- Enumerating models of DNF faster: breaking the dependency on the formula size
- Breaking the linear-memory barrier in \(\mathsf{MPC}\): fast \(\mathsf{MIS}\) on trees with strongly sublinear memory
- Structural tractability of enumerating CSP solutions
- Enumeration of monadic second-order queries on trees
- Enumeration on trees under relabelings
- Provenance circuits for trees and treelike instances
- Computing thejth solution of a first-order query
- MSO queries on trees: enumerating answers under updates
- Optimizing tree decompositions in MSO
- An Experimental Study of the Treewidth of Real-World Graph Data
- Constant delay enumeration with FPT-preprocessing for conjunctive queries of bounded submodular width
- Enumerating answers to first-order queries over databases of low degree
- First-order queries on classes of structures with bounded expansion
- MSO queries on trees: enumerating answers under updates using forest algebras
- First-order queries on structures of bounded degree are computable with constant delay
- Enumeration for FO Queries over Nowhere Dense Graphs
- Trade-offs in Static and Dynamic Evaluation of Hierarchical Queries
- MSO queries on trees: enumerating answers under updates using forest algebras
- Ranked enumeration for MSO on trees via knowledge compilation
- Constant-delay enumeration for SLP-compressed documents
- Ranked enumeration of MSO logic on words
- Enumeration of minimal hitting sets parameterized by treewidth
- FO-query enumeration over SLP-compressed structures of bounded degree
- Linear delay enumeration and monadic second-order logic
This page was built for publication: MSO Queries on Tree Decomposable Structures Are Computable with Linear Delay
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3613336)
