Enumeration of monadic second-order queries on trees
From MaRDI portal
Recommendations
- MSO Queries on Tree Decomposable Structures Are Computable with Linear Delay
- Linear delay enumeration and monadic second-order logic
- Enumeration on trees under relabelings
- MSO queries on trees: enumerating answers under updates using forest algebras
- MSO queries on trees: enumerating answers under updates
Cited in
(28)- The factorisation forest theorem
- Uniform orderings for generalized coloring numbers
- Structural recursion as a query language on lists and ordered trees
- Structural tractability of enumerating CSP solutions
- Enumeration complexity of logical query problems with second-order variables
- Enumeration on trees under relabelings
- Provenance circuits for trees and treelike instances
- MSO Queries on Tree Decomposable Structures Are Computable with Linear Delay
- MSO queries on trees: enumerating answers under updates
- Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-wideness
- Optimizing tree decompositions in MSO
- Algorithmic properties of sparse digraphs
- An Experimental Study of the Treewidth of Real-World Graph Data
- String-to-string interpretations with polynomial-size output
- 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
- Enumeration for FO Queries over Nowhere Dense Graphs
- A distributed low tree-depth decomposition algorithm for bounded expansion classes
- Trade-offs in Static and Dynamic Evaluation of Hierarchical Queries
- A color-avoiding approach to subgraph counting in bounded expansion classes
- Regular \(\mathcal{D}\)-length: a tool for improved prefix-stable forward Ramsey factorisations
- MSO queries on trees: enumerating answers under updates using forest algebras
- Ranked enumeration for MSO on trees via knowledge compilation
- FO-query enumeration over SLP-compressed structures of bounded degree
- On low tree-depth decompositions
- Linear delay enumeration and monadic second-order logic
This page was built for publication: Enumeration of monadic second-order queries on trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2946714)
