Cargando…

The shortest path problem in the stochastic networks with unstable topology

The stochastic shortest path length is defined as the arrival probability from a given source node to a given destination node in the stochastic networks. We consider the topological changes and their effects on the arrival probability in directed acyclic networks. There is a stable topology which s...

Descripción completa

Detalles Bibliográficos
Autores principales: Shirdel, Gholam H., Abdolhosseinzadeh, Mohsen
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Springer International Publishing 2016
Materias:
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5020038/
https://www.ncbi.nlm.nih.gov/pubmed/27652102
http://dx.doi.org/10.1186/s40064-016-3180-7