Abstract:
The paper discusses an original contextual approach to assessing the connectivity of a two-terminal graph, based on identifying dominant connections. The issue of changing the probability of connectivity of the entire graph is being solved by changing the capacity of the edges belonging to the set of dominant connections. Various methods for changing the connectivity probability of the graph under consideration are proposed, both from the standpoint of point and multiple impact on the selected edges. A comparative analysis of the proposed methods was carried out, and the appropriate conditions were determined to achieve maximum effect.