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

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

Authors
M. Kitsak, A. Ganin, A. Elmokashfi, H. Cui, D. A. Eisenberg, D. L. Alderson, D. Korkin and I. Linkov
Status
Published
Publication type
Journal Article
Year of publication
2023
Journal
Nature Communications
Publisher
Nature
Citation key
17002
Google Scholar BibTex