"Finding shortest and nearly shortest path nodes in large substantially ..."

Maksim Kitsak et al. (2022)

> Home

Details and statistics

DOI: 10.48550/ARXIV.2204.04117

access: open

type: Informal or Other Publication

metadata version: 2022-04-13

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/corr/abs-2204-04117
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2204-04117
Maksim Kitsak, Alexander A. Ganin, Ahmed Elmokashfi, Hongzhu Cui, Daniel A. Eisenberg, David L. Alderson, Dmitry Korkin, Igor Linkov:
Finding shortest and nearly shortest path nodes in large substantially incomplete networks. CoRR abs/2204.04117 (2022)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.