Geodesic
Connectivity of the planar graph with highly reliable edges
Prikladnaâ diskretnaâ matematika, no. 3 (2012), pp. 103-107

Voir la notice de l'article provenant de la source Math-Net.Ru

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.
Keywords: connectivity probability, dual graph, minimal cross section. 
@article{PDM_2012_3_a11,
     author = {G. Sh. Tsitsiashvili and A. S. Losev},
     title = {Connectivity of the planar graph with highly reliable edges},
     journal = {Prikladna\^a diskretna\^a matematika},
     pages = {103--107},
     publisher = {mathdoc},
     number = {3},
     year = {2012},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/PDM_2012_3_a11/}
}
TY  - JOUR
AU  - G. Sh. Tsitsiashvili
AU  - A. S. Losev
TI  - Connectivity of the planar graph with highly reliable edges
JO  - Prikladnaâ diskretnaâ matematika
PY  - 2012
SP  - 103
EP  - 107
IS  - 3
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/PDM_2012_3_a11/
LA  - ru
ID  - PDM_2012_3_a11
ER  - 
%0 Journal Article
%A G. Sh. Tsitsiashvili
%A A. S. Losev
%T Connectivity of the planar graph with highly reliable edges
%J Prikladnaâ diskretnaâ matematika
%D 2012
%P 103-107
%N 3
%I mathdoc
%U http://geodesic.mathdoc.fr/item/PDM_2012_3_a11/
%G ru
%F PDM_2012_3_a11
G. Sh. Tsitsiashvili; A. S. Losev. Connectivity of the planar graph with highly reliable edges. Prikladnaâ diskretnaâ matematika, no. 3 (2012), pp. 103-107. http://geodesic.mathdoc.fr/item/PDM_2012_3_a11/