Highly Influenced

# 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} }

- Published 2009 in CATS

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

#### From This Paper

##### Figures, tables, and topics from this paper.

3 Citations

14 References

Similar Papers