Edge-selection heuristics for computing Tutte polynomials

DOI10.4086/CJTCS.2010.006MaRDI QIDQ5414580zbMATH OpenOpenAlexFDO

Authors David Pearce, Gary Haggard, Gordon Royle

Publication date 6 May 2014

Published in Chicago Journal of Theoretical Computer Science (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4086/cjtcs.2010.006

Mathematics Subject Classification ID

Graph polynomials (05C31) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• Computing Tutte polynomials
• A new edge selection heuristic for computing the Tutte polynomial of an undirected graph
• Computing the Tutte polynomial of a graph of moderate size
• Graph polynomials and their applications. I: The Tutte polynomial
• Polynomial time randomized approximation schemes for Tutte–Gröthendieck invariants: The dense case

Cited in

(7)

• The Tutte polynomial of a graph, depth-first search, and simplicial complex partitions
• Computing the Tutte polynomial of Archimedean tilings
• Computing Tutte polynomials
• Handbook of the Tutte polynomial and related topics
• Finding the chromatic polynomial of Cayley graphs using the Tutte polynomial.
• A new edge selection heuristic for computing the Tutte polynomial of an undirected graph
• Computing the Tutte polynomial of a graph of moderate size

Describes a project that uses

Uses Software

• nauty

This page was built for publication: Edge-selection heuristics for computing Tutte polynomials

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5414580)