Parallel approximate undirected shortest paths via low hop emulators

DOI10.1145/3357713.3384321OpenAlexW3034903651MaRDI QIDQ5144919

Peilin Zhong, Alexandr Andoni, Clifford Stein

Publication date: 19 January 2021

Published in: Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1911.01956

zbMATH Keywords

parallel algorithmsshortest pathsminimum cost flowlow hop emulators

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (5)

Deterministic Massively Parallel Connectivity ⋮ Minimum cost flow in the CONGEST model ⋮ Brief Announcement: Minimum Cost Maximum Flow in the CONGEST Model ⋮ Brief Announcement: The Laplacian Paradigm in Deterministic Congested Clique ⋮ Linear-size hopsets with small hopbound, and constant-hopbound hopsets in RNC

This page was built for publication: Parallel approximate undirected shortest paths via low hop emulators