"A Sublinear Algorithm for Approximate Shortest Paths in Large Networks."

Sabyasachi Basu et al. (2025)

> Home

Details and statistics

DOI: 10.1145/3701551.3703512

access: closed

type: Conference or Workshop Paper

metadata version: 2025-03-07

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/wsdm/BasuKEB025
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/wsdm/BasuKEB025
Sabyasachi Basu, Nadia Koshima, Talya Eden, Omri Ben-Eliezer, C. Seshadhri:
A Sublinear Algorithm for Approximate Shortest Paths in Large Networks. WSDM 2025: 20-29

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.