Approximate counting via correlation decay in spin systems
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Phase transition for Glauber dynamics for independent sets on regular trees
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Stopping times, metrics and approximate counting
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Path coupling using stopping times
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Correlation decay and deterministic FPTAS for counting colorings of a graph
Journal of Discrete Algorithms
Randomly colouring graphs with girth five and large maximum degree
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Sampling colourings of the triangular lattice
Random Structures & Algorithms
A Deterministic Polynomial-Time Approximation Scheme for Counting Knapsack Solutions
SIAM Journal on Computing
Journal of Combinatorial Theory Series B
| Hi-index | 0.00 |
A fully polynomial randomized approximation scheme is presented for estimating the number of (vertex) k‐colorings of a graph of maximum degree Δ, when k ≥ 2Δ + 1. © 1995 John Wiley & Sons, Inc.