Probability and deterministic characteristics of recursively defined networks
Algorithms of reliability calculation and a length of shortest closed way through all nodes in recursively defined networks are constructed. These networks are defined by a replacement of all arcs in a generating network by previously defined networks or by a gluing of a previously defined network with a generating network in a single node. Volumes of calculations of listed characteristics in these networks are bounded by linear functions of their arcs numbers.
Keywords: recursively defined networks, a reliability, a shortest way length, a maximal flow
