Enumeration of monadic second-order queries on trees
From MaRDI portal
Publication:2946714
DOI10.1145/2528928zbMath1353.68068OpenAlexW2014984050MaRDI QIDQ2946714
Publication date: 17 September 2015
Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/hal-00916400/file/enummso.pdf
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (17)
Enumeration for FO Queries over Nowhere Dense Graphs ⋮ Unnamed Item ⋮ On low tree-depth decompositions ⋮ Trade-offs in Static and Dynamic Evaluation of Hierarchical Queries ⋮ A color-avoiding approach to subgraph counting in bounded expansion classes ⋮ Unnamed Item ⋮ Uniform orderings for generalized coloring numbers ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ A distributed low tree-depth decomposition algorithm for bounded expansion classes ⋮ Unnamed Item ⋮ An Experimental Study of the Treewidth of Real-World Graph Data ⋮ Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-wideness ⋮ The factorisation forest theorem ⋮ Structural tractability of enumerating CSP solutions
This page was built for publication: Enumeration of monadic second-order queries on trees
