|
Prikladnaya Diskretnaya Matematika, 2012, Number 3(17), Pages 103–107
(Mi pdm383)
|
|
|
|
This article is cited in 1 scientific paper (total in 1 paper)
Applied Graph Theory
Connectivity of the planar graph with highly reliable edges
G. Sh. Tsitsiashvili, A. S. Losev Institute of Applied Mathematics, Far-Eastern Branch of the Russian Academy of Sciences, Vladivostok, Russia
Abstract:
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.
Citation:
G. Sh. Tsitsiashvili, A. S. Losev, “Connectivity of the planar graph with highly reliable edges”, Prikl. Diskr. Mat., 2012, no. 3(17), 103–107
Linking options:
https://www.mathnet.ru/eng/pdm383 https://www.mathnet.ru/eng/pdm/y2012/i3/p103
|
Statistics & downloads: |
Abstract page: | 296 | Full-text PDF : | 125 | References: | 52 | First page: | 1 |
|