It is well known that a series-parallel multigraph G can be constructed recursively from its edges. This construction is represented by a binary decomposition tree. This is a rooted binary tree T in which each vertex ...
详细信息
It is well known that a series-parallel multigraph G can be constructed recursively from its edges. This construction is represented by a binary decomposition tree. This is a rooted binary tree T in which each vertex q corresponds to some series-parallel submultigraph of G, denoted by G(q)
