Linear Size Distance Preservers

DOI10.1137/1.9781611974782.39zbMath1410.05033OpenAlexW2346875068MaRDI QIDQ4575776

Greg Bodwin

Publication date: 16 July 2018

Published in: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/1.9781611974782.39

Mathematics Subject Classification ID

Distance in graphs (05C12)

Related Items (9)

Fault-Tolerant Subgraph for Single-Source Reachability: General and Optimal ⋮ Unnamed Item ⋮ Lower Bounds on Sparse Spanners, Emulators, and Diameter-Reducing Shortcuts ⋮ Graph spanners: a tutorial review ⋮ A fast algorithm for source-wise round-trip spanners ⋮ Improved Guarantees for Vertex Sparsification in Planar Graphs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Distance-Preserving Graph Contractions

This page was built for publication: Linear Size Distance Preservers