This article is cited in 2 scientific papers (total in 2 papers)
Applied Graph Theory
Asymptotics for connectivity probability of graph with low reliable arcs
G. Sh. Tsitsiashvili, M. A. Osipova, A. S. Losev
Institute of Applied Mathematics, Far-Eastern Branch of the Russian Academy of Sciences, Vladivostok
Asymptotics of connectivity probabilities for complete graphs with the low reliable arcs and for all pairs of nodes in them are constructed. Parameters of these asymptotics are characteristics of spanning trees and shortest paths. The calculation of the spanning trees characteristics is based on the Kirchhoff–Trent theorem. Modifications of classical algorithms are applied to calculate the characteristics of shortest paths.
spanning tree, Kirchhoff's matrix, shortest path, connectivity probability, calculation complexity.
PDF file (512 kB)
G. Sh. Tsitsiashvili, M. A. Osipova, A. S. Losev, “Asymptotics for connectivity probability of graph with low reliable arcs”, Prikl. Diskr. Mat., 2013, no. 1(19), 93–98
Citation in format AMSBIB
\by G.~Sh.~Tsitsiashvili, M.~A.~Osipova, A.~S.~Losev
\paper Asymptotics for connectivity probability of graph with low reliable arcs
\jour Prikl. Diskr. Mat.
Citing articles on Google Scholar:
Related articles on Google Scholar:
This publication is cited in the following articles:
G. Sh. Tsitsiashvili, M. A. Osipova, A. S. Losev, “Asimptotiki veroyatnostei svyaznosti par vershin grafa”, PDM. Prilozhenie, 2013, no. 6, 90–92
V. V. Shakhov, A. N. Yurgenson, O. D. Sokolova, “Effektivnyi metod generatsii sluchainykh geometricheskikh grafov dlya modelirovaniya besprovodnykh setei”, PDM, 2016, no. 4(34), 99–109
|Number of views:|