# Polynomial Time Randomized Approximation Schemes for Tutte-Gröthendieck Invariants: The Dense Case

@article{Alon1994PolynomialTR, title={Polynomial Time Randomized Approximation Schemes for Tutte-Gr{\"o}thendieck Invariants: The Dense Case}, author={Noga Alon and Alan M. Frieze and Dominic Welsh}, journal={Random Struct. Algorithms}, year={1994}, volume={6}, pages={459-478} }

- Published 1994 in Random Struct. Algorithms
DOI:10.1002/rsa.3240060409

The Tutte-Gröthendieck polynomial T (G;x, y) of a graph G encodes numerous interesting combinatorial quantities associated with the graph. Its evaluation in various points in the (x, y) plane give the number of spanning forests of the graph, the number of its strongly connected orientations, the number of its proper k-colorings, the (all terminal) reliability probability of the graph, and various other invariants the exact computation of each of which is well known to be #P -hard. Here we… CONTINUE READING

#### From This Paper

##### Topics from this paper.

#### Citations

##### Publications citing this paper.

Showing 1-10 of 28 extracted citations

## Randomized Algorithms: Approximation, Generation and Counting

View 4 Excerpts

Highly Influenced

## Subset Glauber Dynamics on Graphs, Hypergraphs and Matroids of Bounded Tree-Width

View 7 Excerpts

Highly Influenced

## Rapid mixing of subset Glauber dynamics on graphs of bounded tree-width

View 5 Excerpts

Highly Influenced

## Approximating the Number of Acyclic Orientations for a Class of Sparse Graphs

View 7 Excerpts

Highly Influenced

## Deposited in DRO : 23 May 2008 Version of attached file :

View 7 Excerpts

Highly Influenced

## Graphs with Many Strong Orientations

View 2 Excerpts

## Approximately Counting Embeddings into Random Graphs

View 1 Excerpt

#### References

##### Publications referenced by this paper.

Showing 1-10 of 23 references

## The complexity of colouring problems on dense graphs

View 5 Excerpts

Highly Influenced

## Complexity: Knots, Colourings and Counting, London Mathematical Society Lecture Note Series 186

View 5 Excerpts

Highly Influenced

## The Compunational Complexity of the Tutte Plane: the Bipartite Case

View 5 Excerpts

Highly Influenced

## The Probabilistic Method

View 3 Excerpts

Highly Influenced

## The Tutte polynomial and its applications, Matroid Applictions

View 4 Excerpts

Highly Influenced

## On the principal edge tripartition of a graph, Ann

View 2 Excerpts

Highly Influenced

## Facing up to arrangements: face count formulas for partitions of spaces by hyperplanes

View 2 Excerpts

Highly Influenced

## On the random cluster model I. Introduction and relation to other models, Physica

View 2 Excerpts

Highly Influenced

## Approximately Counting Hamilton Cycles in Dense Graphs

View 4 Excerpts

## A Monte-Carlo Algorithm for Estimating the Permanent

View 3 Excerpts