MSO Queries on Tree Decomposable Structures Are Computable with Linear Delay
From MaRDI portal
Publication:3613336
DOI10.1007/11874683_11zbMath1225.68268OpenAlexW1573632260MaRDI QIDQ3613336
Publication date: 12 March 2009
Published in: Computer Science Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11874683_11
Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Combinatorics in computer science (68R05) Automata and formal grammars in connection with logical questions (03D05)
Related Items (12)
Enumeration for FO Queries over Nowhere Dense Graphs ⋮ Trade-offs in Static and Dynamic Evaluation of Hierarchical Queries ⋮ Computing thejth solution of a first-order query ⋮ Compact representation for answer sets of \(n\)-ary regular queries ⋮ Unnamed Item ⋮ Enumerating models of DNF faster: breaking the dependency on the formula size ⋮ Linear delay enumeration and monadic second-order logic ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ An Experimental Study of the Treewidth of Real-World Graph Data ⋮ Structural tractability of enumerating CSP solutions
This page was built for publication: MSO Queries on Tree Decomposable Structures Are Computable with Linear Delay
