A faster method for sampling independent sets

Authors:
Mark Huber
Affiliations:
Department of Statistics, Stanford University, Stanford, CA
Venue:
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Year:
2000

Random generation of combinatorial structures from a uniform

Theoretical Computer Science
Exact sampling with coupled Markov chains and applications to statistical mechanics

Proceedings of the seventh international conference on Random structures and algorithms
Exact sampling and approximate counting techniques

STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Perfect sampling using bounding chains

Perfect sampling using bounding chains

Hi-index	0.00