EVALUATION OF RELIABILITY OF THE ORGANIZATIONAL STRUCTURES DEFINED BY PLANAR GRAPH

Problem statement. Problems of evaluating reliability of organizational structures are closelyconnected with their topology. In case it is possible to present organizational structures in the formof consecutive or parallel graphs, estimation of reliability does not cause any difficulty, and is reducedto known formulas of the theory of reliability for consistently or in parallel connected elements.In practice, unfortunately, there are rather few organizational schemes with a serial-parallelstructure. Most of them can be presented by an arbitrary graph which cannot be presented as acombination of consecutive and parallel links. So, there emerges a problem of estimating reliabilityof structures of arbitrary type.Results and conclusions. This study presents an algorithm for the estimation of paths and paths ina graph of an arbitrary structure and cuts in a planar graph. It is shown that due to its duality property,the same algorithm can be also used in the calculation of a number of cuts and their enumeration,but this applies to a planar graph only. Based on this, reliability of organizational structuresof arbitrary type can be evaluated.