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...
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 |
Ejemplares similares
-
A genetic algorithm for the arrival probability in the stochastic networks
por: Shirdel, Gholam H., et al.
Publicado: (2016) -
Shortest Paths in Multiplex Networks
por: Ghariblou, Saeed, et al.
Publicado: (2017) -
On the shortest path problem of uncertain random digraphs
por: Li, Hao, et al.
Publicado: (2022) -
An Improved Physarum polycephalum Algorithm for the Shortest Path Problem
por: Zhang, Xiaoge, et al.
Publicado: (2014) -
Shortest path counting in probabilistic biological networks
por: Ren, Yuanfang, et al.
Publicado: (2018)