Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

114

Voted

STOC
2007
ACM

101views Algorithms» more STOC 2007»

Inapproximability of the Tutte polynomial

16 years 3 months ago

Inapproximability of the Tutte polynomial

Download www.win.tue.nl

Leslie Ann Goldberg, Mark Jerrum

Real-time Traffic

Algorithms | STOC 2007 | Tutte Polynomial |

claim paper

Related Content

» On the colored Tutte polynomial of a graph of bounded treewidth

» Parametrized Tutte Polynomials of Graphs and Matroids

» Homomorphisms and Polynomial Invariants of Graphs

» The Jones polynomial and graphs on surfaces

» A Tuttestyle proof of Brylawskis tensor product formula

» Computing the Tutte Polynomial on Graphs of Bounded CliqueWidth

» A Bijection for Eulerianequivalence Classes of Totally Cyclic Orientations

» Chain polynomials and Tutte polynomials

» From a Zoo to a Zoology Towards a General Theory of Graph Polynomials

Post Info
More Details (n/a)

Added	03 Dec 2009
Updated	03 Dec 2009
Type	Conference
Year	2007
Where	STOC
Authors	Leslie Ann Goldberg, Mark Jerrum

Comments (0)