Parallel Metric Tree Embedding Based on an Algebraic View on Moore-Bellman-Ford
From MaRDI portal
Publication:4625664
DOI10.1145/3231591zbMath1426.68211arXiv1509.09047OpenAlexW2902652525WikidataQ128878342 ScholiaQ128878342MaRDI QIDQ4625664
Christoph Lenzen, Stephan Friedrichs
Publication date: 25 February 2019
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1509.09047
Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)
Related Items
Single-source shortest paths in the CONGEST model with improved bounds ⋮ Decentralized Low-Stretch Trees via Low Diameter Graph Decompositions ⋮ A Deterministic Almost-Tight Distributed Algorithm for Approximating Single-Source Shortest Paths ⋮ Linear-size hopsets with small hopbound, and constant-hopbound hopsets in RNC ⋮ Lasserre integrality gaps for graph spanners and related problems