Approximating fractional hypertree width
From MaRDI portal
Publication:2930305
DOI10.1145/1721837.1721845zbMath1300.05201OpenAlexW1983022219MaRDI QIDQ2930305
No author found.
Publication date: 18 November 2014
Published in: (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1721837.1721845
No records found.
No records found.
Related Items (16)
Structural tractability of counting of solutions to conjunctive queries ⋮ Tractability in constraint satisfaction problems: a survey ⋮ Structural decompositions for problems with global constraints ⋮ The Power of Local Consistency in Conjunctive Queries and Constraint Satisfaction Problems ⋮ Covers of Query Results ⋮ HyperBench ⋮ Trade-offs in Static and Dynamic Evaluation of Hierarchical Queries ⋮ Solving Graph Problems via Potential Maximal Cliques ⋮ Efficiently enumerating minimal triangulations ⋮ Tree projections and constraint optimization problems: fixed-parameter tractability and parallel algorithms ⋮ Tractable structures for constraint satisfaction with truth tables ⋮ Greedy strategies and larger islands of tractability for conjunctive queries and constraint satisfaction problems ⋮ Unnamed Item ⋮ Structural tractability of enumerating CSP solutions ⋮ Constructing NP-intermediate problems by blowing holes with parameters of various properties ⋮ Myhill-Nerode Methods for Hypergraphs
This page was built for publication: Approximating fractional hypertree width
