Correlation decay and deterministic FPTAS for counting colorings of a graph

Approximation Algorithms for NP-Hard Problems

Dorit S. Hochba · ACM SIGACT News · 1997 · 3.1K citations · Full text

Computing, Computer Science, Mathematics +13

Prescribing a System of Random Variables by Conditional Distributions

R. L. Dobrushin · Theory of Probability and Its Applications · 1970 · 606 citations

Natural Sciences, Mathematics, Probability Theory +13

Counting independent sets up to the tree threshold

Dror Weitz · 2006 · 444 citations

Natural Sciences, Computer Science, Mathematics +13

Stochastic Models of Computer Communication Systems

F. P. Kelly · Journal of the Royal Statistical Society Series B (Statistical Methodology) · 1985 · 364 citations

Computing, Computer Science, Computer Systems +16

A very simple algorithm for estimating the number of k‐colorings of a low‐degree graph

Mark Jerrum · Random Structures and Algorithms · 1995 · 296 citations

Natural Sciences, Computer Science, Mathematics +12