Publisher
Springer Berlin Heidelberg
Reference45 articles.
1. Lecture Notes in Mathematics;D. Aldous,1982
2. Annan, J.D.: A randomised approximation algorithm for counting the number of forests in dense graphs. Comb. Probab. Comput. 3, 273–283 (1994)
3. Azar, Y., Broder, A.Z., Frieze, A.M.: On the problem of approximating the number of bases of a matroid. Inf. Process. Lett. 50, 9–11 (1993)
4. Lecture Notes in Computer Science;E. Bartels,1995
5. Broder, A.Z.: How hard is it to marry at random? In: Proceedings of the Eighteenth Annual ACM Symposium on Theory of Computing, pp. 50–58 (1986). Erratum in Proceedings of the 20th Annual ACM Symposium on Theory of Computing, p. 51 (1988)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献