Hypertree width and related hypergraph invariants
From MaRDI portal
Publication:2461773
Recommendations
Cites work
- A comparison of structural CSP decomposition methods
- Approximating clique-width and branch-width
- Graph minors. X: Obstructions to tree-decomposition
- Graph searching and a min-max theorem for tree-width
- Graph-Theoretic Concepts in Computer Science
- Graph-Theoretic Concepts in Computer Science
- scientific article; zbMATH DE number 1057879 (Why is no real title available?)
- Hypertree decompositions and tractable queries
- Marshals, monotone marshals, and hypertree-width
- Robbers, marshals, and guards: Game theoretic and logical characterizations of hypertree width.
Cited in
(32)- Robbers, marshals, and guards: Game theoretic and logical characterizations of hypertree width.
- Hypertree-depth and minors in hypergraphs
- Fast and parallel decomposition of constraint satisfaction problems
- Tractability beyond -acyclicity for conjunctive queries with negation and SAT
- Large hypertree width for sparse random hypergraphs
- Structural tractability of counting of solutions to conjunctive queries
- Tractability in constraint satisfaction problems: a survey
- Structural decompositions for problems with global constraints
- Enumeration of minimal dominating sets and variants
- Marshals, monotone marshals, and hypertree-width
- Tree Projections: Hypergraph Games and Minimality
- Hypertree-width and related hypergraph invariants
- On minimal constraint networks
- Tree projections: Game characterization and computational aspects
- Tree projections and structural decomposition methods: minimality and game-theoretic characterization
- Computing hypergraph width measures exactly
- Fractional edge cover number of Model RB
- The treewidth of 2-section of hypergraphs
- Tangles and single linkage hierarchical clustering
- HyperBench. A benchmark and tool for hypergraphs and empirical findings
- The Power of Local Consistency in Conjunctive Queries and Constraint Satisfaction Problems
- Width functions for hypertree decompositions
- Decomposing Quantified Conjunctive (or Disjunctive) Formulas
- Spined categories: generalizing tree-width beyond graphs
- Tangles and Hierarchical Clustering
- Fast parallel hypertree decompositions in logarithmic recursion depth
- FPT approximation of generalised hypertree width for bounded intersection hypergraphs
- Untangling Gaussian mixtures
- Diversity of answers to conjunctive queries
- Monotonicity of the cops and robber game for bounded depth treewidth
- Greedy strategies and larger islands of tractability for conjunctive queries and constraint satisfaction problems
- FPT approximation of generalised hypertree width for bounded intersection hypergraphs
This page was built for publication: Hypertree width and related hypergraph invariants
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2461773)
