Finding shortest and nearly shortest path nodes in large substantially incomplete networks by hyperbolic mapping

Kitsak, M., Ganin, A., Elmokashfi, A., Cui, H., Eisenberg, D. A., Alderson, D. L., Korkin, D., & Linkov, I. (2023). Finding shortest and nearly shortest path nodes in large substantially incomplete networks by hyperbolic mapping. Nature Communications, 14(1). https://doi.org/10.1038/s41467-022-35181-w

Authors:

Maksim Kitsak

Alexander Ganin

Ahmed Elmokashfi

Hongzhu Cui

Daniel A. Eisenberg

David L. Alderson

Dmitry Korkin

Igor Linkov

Affiliated Authors:

Hongzhu Cui

Columbia Affiliation: