Cargando…
Shortest Paths in Multiplex Networks
The shortest path problem is one of the most fundamental networks optimization problems. Nowadays, individuals interact in extraordinarily numerous ways through their offline and online life (e.g., co-authorship, co-workership, or retweet relation in Twitter). These interactions have two key feature...
Autores principales: | Ghariblou, Saeed, Salehi, Mostafa, Magnani, Matteo, Jalili, Mahdi |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Nature Publishing Group UK
2017
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5438413/ https://www.ncbi.nlm.nih.gov/pubmed/28526822 http://dx.doi.org/10.1038/s41598-017-01655-x |
Ejemplares similares
-
Shortest path counting in probabilistic biological networks
por: Ren, Yuanfang, et al.
Publicado: (2018) -
Finding shortest and nearly shortest path nodes in large substantially incomplete networks by hyperbolic mapping
por: Kitsak, Maksim, et al.
Publicado: (2023) -
The shortest path problem in the stochastic networks with unstable topology
por: Shirdel, Gholam H., et al.
Publicado: (2016) -
Shortest path and Schramm-Loewner Evolution
por: Posé, N., et al.
Publicado: (2014) -
Simulating SIR processes on networks using weighted shortest paths
por: Tolić, Dijana, et al.
Publicado: (2018)