HIGHLIGHTS
- who: Georg Gottlob from the University of Oxford, Oxford, UK have published the research: Fast and parallel decomposition of constraint satisfaction problems, in the Journal: (JOURNAL)
- what: The authors focus on Generalized Hypertree Decompositions (GHD) , and generalized hypertree width (ghw). The overall aim of the work is therefore to advance the art of computing hypergraph decompositions and to make the use of GHDs for solving CSPs applicable to a significantly wider range of CSP instances than previous methods. More specifically, the authors derive the following research goals: Main Goal: Provide major improvements for computing hypergraph . . .
If you want to have access to all the content you need to log in!
Thanks :)
If you don't have an account, you can create one here.