Polynomial time randomized approximation schemes for Tutte–Gröthendieck invariants: The dense case

Random Structures & Algorithms

Volumn 6, Issue 4, 1995, Pages 459-478

  Alon, Noga ^a   Frieze, Alan ^b   Welsh, Dominic ^c  

^a TEL AVIV UNIVERSITY   (Israel)

^b CARNEGIE MELLON UNIVERSITY   (United States)

^c MERTON COLLEGE   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84990630755     PISSN: 10429832     EISSN: 10982418     Source Type: Journal    
DOI: 10.1002/rsa.3240060409     Document Type: Article

References (23)

1. A randomised approximation algorithm for counting the number of forests in dense graphs
2. The Tutte polynomial and its applications
3. The complexity of colouring problems on dense graphs
4. On the random cluster model I. Introduction and relation to other models
5. On the computational complexity of the Jones and Tutte polynomials
6. A Monte‐Carlo algorithm for estimating the permanent
7. Monte‐Carlo algorithms for the planar multiterminal network reliability problem
8. The Tutte polynomial and percolation
9. On the principal edge tripartition of a graph
10. A theorem on graphs, with an application to a problem in traffic control
11. Acyclic orientations of graphs
12. A spanning tree expansion of the Jones polynomial
13. The computational complexity of the Tutte plane: the bipartite case
14. Randomised approximation in the Tutte plane
15. Facing up to arrangements: face count formulas for partitions of spaces by hyperplanes