57 search results - page 3 / 12 » Inapproximability of the Tutte polynomial |
DM
2008
13 years 10 months ago
2008
We construct an "orbital Tutte polynomial" associated with a dual pair M and M of matrices over a principal ideal domain R and a group G of automorphisms of the row spac...
TOMS
2010
13 years 8 months ago
2010
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 comb...
DM
2002
13 years 9 months ago
2002
Let ^G be a graph obtained from a graph G with no loops or coloops by replacing each edge e = uw of G by a connected graph He that has only the vertices u and w in common with the...
FOCS
2008
IEEE
14 years 4 months ago
2008
IEEE
The deletion–contraction algorithm is perhaps the most popular method for computing a host of fundamental graph invariants such as the chromatic, flow, and reliability polynomi...
COMBINATORICS
2002
13 years 9 months ago
2002
We present generalisations of several MacWilliams type identities, including those by Kl