A general lower bound for mixing of single-site dynamics on graphs.

Thomas P. Hayes Alistair Sinclair

Published in: FOCS (2005)

Keyphrases

lower bound
upper bound
special case
website
dynamic programming
branch and bound
closely related
branch and bound algorithm
data sets
neural network
combinatorial optimization
graph matching
graph theoretic
polynomial approximation