In this paper, an algorithm based on the conceptof dual graphs is constructed for calculation of incoherence probability for planar graphswith the high reliable edges. Numerical experiments show that, in a comparison with theMonte-Carlo method, this algorithm decreases calculation complexity significantly.
Download file
Counter downloads: 60
- Title Connectivity of the planar graph with highlyreliable edges
- Headline Connectivity of the planar graph with highlyreliable edges
- Publesher
Tomsk State University - Issue Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics 3(17)
- Date:
- DOI
Keywords
вероятность связности, двойственный граф, минимальный разрез, connectivity probability, dual graph, minimal cross sectionAuthors
References
Золотухин И. В. Углеродные нанотрубки / / Соросовский образовательный журнал. 1999. №3. С. 111-115.
Harary F. and Manvel B. On the Number of Cycles in a Graph / / Matematickycasopis. 1971. V. 21. No. 1. P. 55-63.
Прасолов В. В. Элементы комбинаторной и дифференциальной топологии. М.: МЦНМО, 2004. 352 с.
Whithney H. Nonseparable and planar graphs / / Trans. American Math. Soc. 1932. V. 34. P. 39-362.
Tsitsiashvili G. Sh. Complete calculation of disconnection probability in planar graphs // Reliability: Theory and Applications. 2012. V. 1(24). No. 1. P. 154-159.
Буртин Ю, Питтель Б. Асимптотические оценки надёжности сложных систем / / Техническая кибернетика. 1972. Т. 10. №3. С. 90-96.
Connectivity of the planar graph with highlyreliable edges | Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics. 2012. № 3(17).
Download full-text version
Download fileCounter downloads: 247