Полиномиальность нахождения оценок в общей задаче синтеза надежных сетей

Abstract

We consider the design minimum cost network problem under requirement that if edges of any isomorphic subgraph to given a graph, are deleted from the network then there exist a path between every pair of distinct nodes in the network. It is shown that when the graph has a simple structure the upper and lower bounds for this problem can be defined by polynomial time algorithm.