吉林大学学报（理学版）2013，Vol.51Issue(2)：257-266,10.DOI:10.7694/jdxblxb20130223
基于分割的超树分解方法
Separation-Based Hypertree Decomposition
摘要
Abstract
Based on det-k-decomp algorithm, along with the noting isomorphic component and reducing the search space for an appropriate separator, the authors presented a new class of hypertree decomposition-, separated hypertree decomposition and presented a new tractable hypertree decomposition algorithm——sht-k-decomp, which can improve the efficiency of constrain satisfaction problem solving effectively. The experimental results on most instances show that our method outperforms det-k-decomp.关键词
人工智能/超树分解/约束满足问题Key words
artificial intelligence/ hypertree decomposition/ constraint satisfaction problems分类
信息技术与安全科学引用本文复制引用
王涛,王瑞芹,李占山,陈超..基于分割的超树分解方法[J].吉林大学学报（理学版）,2013,51(2):257-266,10.基金项目
国家自然科学基金(批准号:60873148 （）
60973089 （）
61170314 （）
61272208)和吉林省科技发展计划项目(批准号:20071106). （批准号:20071106）
