Evaluating a weighted graph polynomial for graphs of bounded tree-width

Abstract

We show that for any k there is a polynomial time algorithm to evaluate the weighted graph polynomial U of any graph with tree-width at most k at any point. For a graph with n vertices, the algorithm requires O(akn 2k+3) arithmetical operations, where ak depends only on k.