Evaluating a Weighted Graph Polynomial for Graphs of Bounded Tree-Width
Keyword(s):
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(a_k n^{2k+3})$ arithmetical operations, where $a_k$ depends only on $k$.
Keyword(s):
Keyword(s):
Keyword(s):
2014 ◽
Vol 61
(1)
◽
pp. 51-78
◽
2002 ◽
Vol 50
(8)
◽
pp. 1935-1941
◽
2003 ◽
Vol 25
(8)
◽
pp. 659-666
◽