Improved sourcewise roundtrip spanners with constant stretch

DOI10.1007/978-3-031-49190-0_21MaRDI QIDQ6591481zbMATH OpenFDO

Authors Eli Stafford, Chunjiang Zhu

Publication date 22 August 2024

Full work available at URL https://doi.org/10.1007/978-3-031-49190-0_21

zbMATH Keywords

graph algorithmsgraph spannersrandomized algorithmsroundtrip spanners

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68Rxx)

Cites work

• $(1 + \epsilon,\beta)$-Spanner Constructions for General Graphs
• A fast algorithm for source-wise round-trip spanners
• Additive spanners and \(({\alpha}, {\beta})\)-spanners
• Additive spanners in nearly quadratic time
• Approximate distance oracles
• Approximating cycles in directed graphs: fast algorithms for girth and roundtrip spanners
• Automata, Languages and Programming
• Constant girth approximation for directed graphs in subquadratic time
• Deterministic improved round-trip spanners
• Graph spanners
• Graph spanners: a tutorial review
• scientific article; zbMATH DE number 7788357 (Why is no real title available?)
• Linear size distance preservers
• Low distortion spanners
• New additive spanners
• On sparse spanners of weighted graphs
• Roundtrip spanners and roundtrip routing in directed graphs
• Source-wise round-trip spanners
• Sparse Sourcewise and Pairwise Distance Preservers

This page was built for publication: Improved sourcewise roundtrip spanners with constant stretch

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