AI helps you reading Science
Correlation decay and deterministic FPTAS for counting list-colorings of a graph
SODA, pp.1245-1254, (2007)
EI
Keywords
Abstract
We propose a deterministic algorithm for approximately counting the number of list colorings of a graph. Under the assumption that the graph is triangle free, the size of every list is at least αΔ, where α is an arbitrary constant bigger than α = 2.8432 ..., the solution of αe-1/α = 2, and α is the maximum degree of the graph, we obtain t...More
Code:
Data:
Tags
Comments
数据免责声明
页面数据均来自互联网公开来源、合作出版商和通过AI技术自动分析结果,我们不对页面数据的有效性、准确性、正确性、可靠性、完整性和及时性做出任何承诺和保证。若有疑问,可以通过电子邮件方式联系我们:report@aminer.cn