Sciweavers

57 search results - page 4 / 12
» Inapproximability of the Tutte polynomial
Sort
View
58
Voted
CPC
2006
79views more  CPC 2006»
14 years 11 months ago
On the Complexity of Computing the Tutte Polynomial of Bicircular Matroids
Omer Giménez, Marc Noy
73
Voted
CPC
2006
62views more  CPC 2006»
14 years 11 months ago
The Tutte Polynomial for Matroids of Bounded Branch-Width
Petr Hlinený
CIE
2006
Springer
15 years 3 months ago
From a Zoo to a Zoology: Descriptive Complexity for Graph Polynomials
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...
Johann A. Makowsky