Pages that link to "Item:Q2461773"
From MaRDI portal
The following pages link to Hypertree width and related hypergraph invariants (Q2461773):
Displayed 18 items.
- Structural tractability of counting of solutions to conjunctive queries (Q269342) (← links)
- Tractability in constraint satisfaction problems: a survey (Q271997) (← links)
- Structural decompositions for problems with global constraints (Q272005) (← links)
- On minimal constraint networks (Q359976) (← links)
- Tree projections and structural decomposition methods: minimality and game-theoretic characterization (Q393903) (← links)
- Greedy strategies and larger islands of tractability for conjunctive queries and constraint satisfaction problems (Q729822) (← links)
- Fast and parallel decomposition of constraint satisfaction problems (Q2079275) (← links)
- Tractability beyond \(\beta\)-acyclicity for conjunctive queries with negation and SAT (Q2110380) (← links)
- Large hypertree width for sparse random hypergraphs (Q2343976) (← links)
- Enumeration of Minimal Dominating Sets and Variants (Q3088292) (← links)
- Tree Projections: Game Characterization and Computational Aspects (Q3655155) (← links)
- Fractional Edge Cover Number of Model RB (Q4632176) (← links)
- (Q5092400) (← links)
- HyperBench (Q5102056) (← links)
- The Power of Local Consistency in Conjunctive Queries and Constraint Satisfaction Problems (Q5283239) (← links)
- Decomposing Quantified Conjunctive (or Disjunctive) Formulas (Q5506695) (← links)
- Spined categories: generalizing tree-width beyond graphs (Q6056559) (← links)
- Tangles and Hierarchical Clustering (Q6187073) (← links)