The Tutte Polynomial for Matroids of Bounded Branch-Width

It is a classical result of Jaeger, Vertigan and Welsh that evaluating the Tutte polynomial of a graph is #P-hard in all but a few special points. On the other hand, several papers in the past few years have shown that the Tutte polynomial of a graph can be efficiently computed for graphs of bounded tree-width. In this paper we present a recursive formula computing the Tutte polynomial of a matroid $M$ represented over a finite field (which includes all graphic matroids), using a so called parse tree of a branch-decomposition of $M$. This formula provides an algorithm computing the Tutte polynomial for a representable matroid of bounded branch-width in polynomial time with a fixed exponent.

[1]  William T. Tutte.  A Ring in Graph Theory , 1947 .

[2]  D. Welsh,et al.  On the computational complexity of the Jones and Tutte polynomials , 1990, Mathematical Proceedings of the Cambridge Philosophical Society.

[3]  Dominic J. A. Welsh,et al.  The Computational Complexity of the Tutte Plane: the Bipartite Case , 1992, Combinatorics, Probability and Computing.

[4]  James G. Oxley,et al.  Matroid theory , 1992 .

[5]  Dimitrios M. Thilikos,et al.  Constructive Linear Time Algorithms for Branchwidth , 1997, ICALP.

[6]  Artur Andrzejak,et al.  An algorithm for the Tutte polynomials of graphs of bounded treewidth , 1998, Discret. Math..

[7]  Steven D. Noble,et al.  Evaluating the Tutte Polynomial for Graphs of Bounded Tree-Width , 1998, Combinatorics, Probability and Computing.

[8]  Dominic Welsh,et al.  The Tutte polynomial , 1999, Random Struct. Algorithms.

[9]  Johann A. Makowsky,et al.  Colored Tutte polynomials and Kaufman brackets for graphs of bounded tree width , 2001, SODA '01.

[10]  Petr Hlinený,et al.  Branch-width, parse trees, and monadic second-order logic for matroids , 2003, J. Comb. Theory, Ser. B.

[11]  Petr Hlinený,et al.  A Parametrized Algorithm for Matroid Branch-Width , 2005, SIAM J. Comput..

[12]  Petr Hlinený,et al.  Some Hard Problems on Matroid Spikes , 2007, Theory of Computing Systems.