Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 1 of 1
Full-Text Articles in Physical Sciences and Mathematics
Reducing Redundancy In The Hypertree Decomposition Scheme, Peter Harvey, Aditya K. Ghose
Reducing Redundancy In The Hypertree Decomposition Scheme, Peter Harvey, Aditya K. Ghose
Faculty of Informatics - Papers (Archive)
Hypertree decomposition is a powerful technique for transforming near-acyclic CSPs into acyclic CSPs. Acyclic CSPs have efficient, polynomial time solving techniques, and so these conversions are of interest to the constraints community. We present here an improvement on the opt-k-decomp algorithm for finding an optimal hypertree decomposition.