Connectivity of the planar graph with highly reliable edges

In this paper, an algorithm based on the concept of dual graphs is constructed for calculation of incoherence probability for planar graphs with the high reliable edges. Numerical experiments show that, in a comparison with the Monte-Carlo method, this algorithm decreases calculation complexity significantly.