Semantic tree-width and path-width of conjunctive regular path queries
From MaRDI portal
Cites work
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
- A more general theory of static approximations for conjunctive queries
- A partial k-arboretum of graphs with bounded treewidth
- A Researcher's Digest of GQL (invited talk)
- Advice classes of parametrized tractability
- Approximation and semantic tree-width of conjunctive regular path queries
- Complexity of Finding Embeddings in a k-Tree
- Computational Complexity
- Conjunctive query containment revisited
- Constraint Satisfaction, Bounded Treewidth, and Finite-Variable Logics
- Describing parameterized complexity classes
- Efficient Approximations of Conjunctive Queries
- Evaluating graph queries using semantic treewidth
- Foundations of graph path query languages. Course notes for the reasoning web summer school 2021
- Graph minors. V. Excluding a planar graph
- scientific article; zbMATH DE number 7297854 (Why is no real title available?)
- scientific article; zbMATH DE number 7650987 (Why is no real title available?)
- Hypertree decompositions and tractable queries
- Logspace versions of the theorems of Bodlaender and Courcelle
- Promise constraint satisfaction: algebraic structure and a symmetric Boolean dichotomy
- Regular queries on graph databases
- Semantic acyclicity on graph databases
- Sparsity. Graphs, structures, and algorithms
- The complexity of homomorphism and constraint satisfaction problems seen from the other side
- Tractable hypergraph properties for constraint satisfaction and conjunctive queries
- Treewidth. Computations and approximations
This page was built for publication: Semantic tree-width and path-width of conjunctive regular path queries
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7016766)
