Parallel Breadth-First Search and Exact Shortest Paths and Stronger Notions for Approximate Distances (Journal Article) | NSF PAGES

skip to main content

The NSF Public Access Repository (NSF-PAR) system and access will be unavailable from 10:00 PM ET on Friday, September 29 until 6:00 AM ET on Saturday, September 30 due to maintenance. We apologize for the inconvenience.

Citation Details

This content will become publicly available on January 1, 2024

Parallel Breadth-First Search and Exact Shortest Paths and Stronger Notions for Approximate Distances

Authors:: Rozhoň, Václav; Haeupler, Bernhard; Martinsson, Anders; Grunau, Christoph; Zuzic, Goran

Award ID(s):: 1910588 1814603 1750808

Publication Date:: 2023-01-01

NSF-PAR ID:: 10412406

Journal Name:: ACM Symposium on Theory of Computing

Sponsoring Org:: National Science Foundation

Free Publicly Accessible Full Text
This content will become publicly available on January 1, 2024
Publisher's Version of Record
The DOI is not currently available