A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is
COUNTING MINIMUM COST BOUNDED DEGREE SUBTREES IN GRAPHS WITH SMALL 2-VERTEX-CONNECTED COMPONENTS
In this paper we present new algorithms for counting minimum cost bounded degree subtrees in connected graphs in which the 2-vertex-connected (biconnected) components have small sizes. The 2-vertex-connected components and the cut vertices can be organized into a block-cut vertex tree which is also a tree decomposition with small width of the graph. We present a dynamic programming algorithm which is very efficient on this particular tree decomposition and we also discuss methods of solving thefatcat:fsjsdqmc5jbcxfqfuai5gdwyqu