2430 search results - page 2 / 486 » Computing Tutte Polynomials |
FOCS
2008
IEEE
15 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...
50
Voted
CPC
2006
14 years 9 months ago
2006
STOC
2007
ACM
15 years 9 months ago
2007
ACM
100
Voted
CIE
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. We outline a general theory of graph polynomials which covers all the examples we found in the vast literature, in particular, the chromatic polynomial, various generaliz...
68
Voted
CPC
2006
14 years 9 months ago
2006
We generalize and unify results on parametrized and coloured Tutte polynomials of graphs and matroids due to Zaslavsky [Trans. Amer. Math. Soc. 334 (1992), 317-347] and Bollob