A Randomised Approximation Algorithm for Counting the Number of Forests in Dense Graphs-Reference-Cited by-同舟云学术

A Randomised Approximation Algorithm for Counting the Number of Forests in Dense Graphs

Published:1994-09 Issue:3 Volume:3 Page:273-283
ISSN:0963-5483
Container-title:Combinatorics, Probability and Computing
language:en
Short-container-title:Combinator. Probab. Comp.

Author:

Annan J. D.

Abstract

A polynomial-time randomised algorithm for uniformly generating forests in a dense graph is presented. Using this, a fully polynomial randomised approximation scheme (fpras) for counting the number of forests in a dense graph is created.

Publisher

Cambridge University Press (CUP)

Subject

Applied Mathematics,Computational Theory and Mathematics,Statistics and Probability,Theoretical Computer Science

Reference17 articles.

1. Computational complexity of probabilistic Turing machines;Gill;S1AM Journal of Computing,1977

2. The Computational Complexity of the Tutte Plane: the Bipartite Case

3. On the computational complexity of the Jones and Tutte polynomials

4. The dissection of rectangles into squares

Cited by 15 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Geometric bounds on the fastest mixing Markov chain;Probability Theory and Related Fields;2024-01-30

2. Models of random subtrees of a graph;Probability Surveys;2023-01-01

3. Spanning tree constrained determinantal point processes are hard to (approximately) evaluate;Operations Research Letters;2021-05

4. FAST EXPONENTIAL-TIME ALGORITHMS FOR THE FOREST COUNTING AND THE TUTTE POLYNOMIAL COMPUTATION IN GRAPH CLASSES;International Journal of Foundations of Computer Science;2009-02

5. Negative association in uniform forests and connected graphs;Random Structures and Algorithms;2004