Author:
Montanari Sandro,Penna Paolo
Publisher
Springer Berlin Heidelberg
Reference23 articles.
1. Bordewich, M., Dyer, M.E.: Path coupling without contraction. J. Discrete Algorithms 5(2), 280–292 (2007)
2. Bordewich, M., Dyer, M.E., Karpinski, M.: Path coupling using stopping times and counting independent sets and colorings in hypergraphs. Random Struct. Algorithms 32(3), 375–399 (2008)
3. Bubley, R.: Randomized Algorithms: Approximation, Generation, and Counting. Springer, Heidelberg (2011)
4. Diaconis, P., Holmes, S., Neal, R.M.: Analysis of a nonreversible Markov chain sampler. Ann. Appl. Probab. 10, 726–752 (2000)
5. Došlić, T.: Seven (lattice) paths to log-convexity. Acta Applicandae Math. 110(3), 1373–1392 (2010)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. City-scale Pollution Aware Traffic Routing by Sampling Multiple Max Flows Using MCMC;2023 IEEE 26th International Conference on Intelligent Transportation Systems (ITSC);2023-09-24
2. Detecting and counting small patterns in planar graphs in subexponential parameterized time;Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing;2020-06-06