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

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$

The Ascent to Manufacturing Competitiveness: Defense Firms vs. Non-Defense Firm

Facing rapidly changing markets and increasing competition, the competitive environment of the defense industry has undergone extensive restructuring, significantly more so than for the non-defense sector. This comprehensive survey of defense and non-defense firms offers insight into the defense industry\u27s journey into open competition, as well as insight into different strategic approaches to manufacturing competitiveness during this critical period. The data suggest that the surviving defense firms have strengthened, and that defense and non-defense manufacturers alike are responding competitively to the call of the global economy