skip to main content

Explore Research Products in the NSF-PAR

  • NSF Public Access
  • Search Results
  • Undirected (1+𝜀)-shortest paths via minor-aggregates: near-optimal deterministic parallel and distributed algorithms
Title: Undirected (1+𝜀)-shortest paths via minor-aggregates: near-optimal deterministic parallel and distributed algorithms
Award ID(s):
1910588 1814603 1750808
NSF-PAR ID:
10359543
Author(s) / Creator(s):
; ; ; ;
Date Published:
Journal Name:
ACM Symposium on Theory of Computing
Page Range / eLocation ID:
478 to 487
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
No document suggestions found
  • Citation Formats
  • MLA
  • APA
  • Chicago
  • BibTeX
  • Save / Share this Record
  • Send to Email