Edge-Selection Heuristics for Computing Tutte Polynomials

@inproceedings{Pearce2009EdgeSelectionHF,
  title={Edge-Selection Heuristics for Computing Tutte Polynomials},
  author={David J. Pearce and Gary Haggard and Gordon Royle},
  booktitle={CATS},
  year={2009}
}
The Tutte polynomial of a graph, also known as the partition function of the q-state Potts model, is a 2-variable polynomial graph invariant of considerable importance in both combinatorics and statistical physics. It contains several other polynomial invariants, such as the chromatic polynomial and flow polynomial as partial evaluations, and various numerical invariants such as the number of spanning trees as complete evaluations. We have developed the most efficient algorithm to-date for… CONTINUE READING
3 Citations
14 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 14 references

Modern Graph Theory. Number 184 in Graduate Texts in Mathematics

  • B. Bollobás
  • 1998
Highly Influential
3 Excerpts

Sokal . The multivariate Tutte Polynomial ( alias Potts model ) for graphs and matroids

  • D. Alan
  • Surveys in combinatorics
  • 1995

The Tutte poynomial and its applications

  • T. Brylawski, J. Oxley.
  • Encyclopedia Math . Appl .
  • 1992

Similar Papers

Loading similar papers…