Reference38 articles.
1. [1] Aldous (D.) and Fill (J. A.).— Reversible Markov chains and random walks on graphs. 2002. http://www.stat.berkeley.edu/~aldous/RWG/book.html. Unfinished monograph, recompiled 2014.
2. [2] Bezáková (I.), Stefankovic (D.), Vazirani (V. V.), and Vigoda (E.).— Accelerating simulated annealing for the permanent and combinatorial counting problems. SIAM Journal on Computing, 37(5), p. 1429-1454 (2008).
3. [3] Blumberg (O.).— Permutations with interval restrictions. PhD thesis, Stanford University (2012).
4. [4] Booth (K. S.) and Lueker (G. S.).— Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms. Journal of Computer and System Sciences, 13(3), p. 335-379 (1976).
5. [5] Brandstädt (A.), Le (V. B.), and Spinrad (J. P.).— Graph Classes: A Survey, volume 3 of Monographs on Discrete Mathematics and Applications. SIAM, Philadelphia (1999).
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Counting Perfect Matchings and the Switch Chain;SIAM Journal on Discrete Mathematics;2019-01