Fingerprint
Dive into the research topics of 'Finding shortest and nearly shortest path nodes in large substantially incomplete networks by hyperbolic mapping'. Together they form a unique fingerprint.- Sort by
- Weight
- Alphabetically
Finding shortest and nearly shortest path nodes in large substantially incomplete networks by hyperbolic mapping
Maksim Kitsak*, Alexander Ganin, Ahmed Elmokashfi, Hongzhu Cui, Daniel A. Eisenberg, David L. Alderson, Dmitry Korkin, Igor Linkov
*Corresponding author for this work
Research output: Contribution to journal › Article › Scientific › peer-review
4
Citations
(Scopus)
79
Downloads
(Pure)