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

HIGHLIGHTS

• who: Maksim Kitsak from the (UNIVERSITY) have published the research work: Finding shortest and nearly shortest path nodes in large substantially incomplete networks by hyperbolic mapping, in the Journal: (JOURNAL) of 28/03/2022
• what: The authors demonstrate the utility of latentgeometric path finding in problems of cellular pathway reconstruction and communication security. The authors demonstrate that geometric localization of shortest paths can be used to validate routing paths in the Internet and reconstruct cellular pathways. The authors evaluate the average precision scores and the average number of node removals needed to disrupt node pairs . . .
  

   

  

  If you want to have access to all the content you need to log in!

  Thanks :)

  Username or Email

  Password

  Remember me

  Lost your password?

  If you don't have an account, you can create one here.