scientific article; zbMATH DE number 7650398

DOI10.4230/LIPICS.ITCS.2020.50MaRDI QIDQ5875752zbMATH OpenFDO

Authors Ruben Becker, Yuval Emek, Christoph Lenzen

Publication date 3 February 2023

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

zbMATH Keywords

graph decompositionsdistributed graph algorithmsparallel graph algorithms(semi-)streaming graph algorithmsmetric tree embeddings

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cited in

(4)

• Low diameter graph decompositions
• Parallel, distributed, and quantum exact single-source shortest paths with negative edge weights
• Brief Announcement: Distributed Construction of Near-Optimal Compact Routing Schemes for Planar Graphs
• Parallel breadth-first search and exact shortest paths and stronger notions for approximate distances

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5875752)