Cargando…
Finding shortest and nearly shortest path nodes in large substantially incomplete networks by hyperbolic mapping
Dynamic processes on networks, be it information transfer in the Internet, contagious spreading in a social network, or neural signaling, take place along shortest or nearly shortest paths. Computing shortest paths is a straightforward task when the network of interest is fully known, and there are...
| Autores principales: | , , , , , , , |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
Nature Publishing Group UK
2023
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9845360/ https://www.ncbi.nlm.nih.gov/pubmed/36650144 http://dx.doi.org/10.1038/s41467-022-35181-w |