Asymptotics of connectivity probabilities for pairs of graph nodes
Prikladnaya Diskretnaya Matematika. Supplement, no. 6 (2013), pp. 90-92
Cet article a éte moissonné depuis la source Math-Net.Ru
For graphs with low reliable arcs, asymptotics of probabilities for connectivities between all pairs of nodes are constructed. Parameters of these asymptotics are characteristics of shortest paths in the graph. To calculate these characteristics, some modifications of classical algorithms are developed. On the base of these results, numerical experiment is realized. This experiment demonstrates advantages of suggested algorithms.
Keywords:
shortest path, connectivity probability, computational complexity.
@article{PDMA_2013_6_a43,
author = {G. Sh. Tsitsiashvili and M. A. Osipova and A. S. Losev},
title = {Asymptotics of connectivity probabilities for pairs of graph nodes},
journal = {Prikladnaya Diskretnaya Matematika. Supplement},
pages = {90--92},
year = {2013},
number = {6},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/PDMA_2013_6_a43/}
}
TY - JOUR AU - G. Sh. Tsitsiashvili AU - M. A. Osipova AU - A. S. Losev TI - Asymptotics of connectivity probabilities for pairs of graph nodes JO - Prikladnaya Diskretnaya Matematika. Supplement PY - 2013 SP - 90 EP - 92 IS - 6 UR - http://geodesic.mathdoc.fr/item/PDMA_2013_6_a43/ LA - ru ID - PDMA_2013_6_a43 ER -
G. Sh. Tsitsiashvili; M. A. Osipova; A. S. Losev. Asymptotics of connectivity probabilities for pairs of graph nodes. Prikladnaya Diskretnaya Matematika. Supplement, no. 6 (2013), pp. 90-92. http://geodesic.mathdoc.fr/item/PDMA_2013_6_a43/
[1] Tsitsiashvili G. Sh., Osipova M. A., Losev A. S., “Asimptotika veroyatnosti svyaznosti grafa s nizkonadezhnymi rebrami”, Prikladnaya diskretnaya matematika, 2013, no. 1(19), 93–98