Network decomposition into minimally linked parts

The paper is concerned with decomposition of a weighed graph into subgraphs, minimally linked in terms of the sum of weights of external edges, a problem regarded as obtaining a multicomponent network of a desired graph structure on a specified network. The proposed solution algorithm proceeds by implicit selection and employs an adaptive strategy of motion along the branching tree and the extimate construction principle.