Roundtrip spanners and roundtrip routing in directed graphs

DOI10.1145/1367064.1367069zbMath1420.68159OpenAlexW1971316210MaRDI QIDQ4962734

Uri Zwick, Mikkel Thorup, Iam Roditty

Publication date: 5 November 2018

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1367064.1367069

zbMATH Keywords

distancesshortest pathsroutingspannersroundtrip

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (9)

Parameterized complexity of directed spanner problems ⋮ Eccentricity queries and beyond using hub labels ⋮ Reachability Preservers: New Extremal Bounds and Approximation Algorithms ⋮ Cone-based spanners of constant degree ⋮ On the VC-dimension of unique round-trip shortest path systems ⋮ Parameterized Complexity of Directed Spanner Problems. ⋮ Multipath Spanners via Fault-Tolerant Spanners ⋮ A fast algorithm for source-wise round-trip spanners ⋮ Distributed Spanner Approximation

This page was built for publication: Roundtrip spanners and roundtrip routing in directed graphs