Search Results for author:
Found 3 papers, 2 papers with code
Incremental Updates of Generalized Hypertree Decompositions
As decompositions can be reused to solve CSPs with the same constraint scopes, investing resources in computing good decompositions is beneficial, even though the computation itself is hard.
The HyperTrac Project: Recent Progress and Future Research Directions on Hypergraph Decompositions
Constraint Satisfaction Problems (CSPs) play a central role in many applications in Artificial Intelligence and Operations Research.
HyperBench: A Benchmark and Tool for Hypergraphs and Empirical Findings
To cope with the intractability of answering Conjunctive Queries (CQs) and solving Constraint Satisfaction Problems (CSPs), several notions of hypergraph decompositions have been proposed -- giving rise to different notions of width, noticeably, plain, generalized, and fractional hypertree width (hw, ghw, and fhw).
