Publisher
Springer Berlin Heidelberg
Reference18 articles.
1. D.J. Aldous. The random walk construction of uniform spanning trees and uniform labelled trees. SIAM Journal on Discrete Mathematics, 3(4):450–465, 1990.
2. D.J. Aldous and J.A. Fill. Reversible Markov Chains and Random Walks on Graphs. 1996. Book in preparation.
3. D. Arquès and J. Françon. Arbres bien étiquetés et fractions multicontinues. In B. Courcelle, editor, Proceedings of 9th Colloquium on Trees in Algebra and Programming, pages 50–61, Bordeaux, France, March 1984. Cambridge University Press.
4. S. Bhatt and J.Y. Cai. Take a walk, grow a tree. In 29th Annunal IEEE Symposium on Foundations of Computer Science, pages 469–478, 1988.
5. G. Brightwell and P. Winkler. Extremal cover times for random walks on trees. Journal of Graph Theory, 14(5):547–554, 1990.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Realizable cycle structures in digraphs;European Journal of Combinatorics;2023-10