AI帮你理解科学
The tree Constraint
CPAIOR, (2005): 64-78
EI
关键词
摘要
This article presents an arc-consistency algorithm for the tree constraint, which enforces the partitioning of a digraphG = (V;E) into a set of vertex-disjoint anti-arborescences. It provides a necessary and suf- cient condition for checking the tree constraint inO(jVj +jEj) time, as well as a complete ltering algorithm takingO(jVj jEj) t...更多
代码:
数据:
标签
评论
数据免责声明
页面数据均来自互联网公开来源、合作出版商和通过AI技术自动分析结果,我们不对页面数据的有效性、准确性、正确性、可靠性、完整性和及时性做出任何承诺和保证。若有疑问,可以通过电子邮件方式联系我们:report@aminer.cn