New Pairwise Spanners
From MaRDI portal
DOI10.4230/LIPIcs.STACS.2015.513zbMath1356.05148MaRDI QIDQ2955020
Publication date: 24 January 2017
Full work available at URL: https://dblp.uni-trier.de/db/conf/stacs/stacs2015.html#Kavitha15
68Q25: Analysis of algorithms and problem complexity
05C12: Distance in graphs
05C85: Graph algorithms (graph-theoretic aspects)
Related Items
A Hierarchy of Lower Bounds for Sublinear Additive Spanners, Fault-Tolerant Subgraph for Single-Source Reachability: General and Optimal, The Sparsest Additive Spanner via Multiple Weighted BFS Trees, Near Isometric Terminal Embeddings for Doubling Metrics, Distributed construction of purely additive spanners, Vertex fault tolerant additive spanners, New pairwise spanners, A fast algorithm for source-wise round-trip spanners, Source-wise round-trip spanners, Near isometric terminal embeddings for doubling metrics, Small Stretch Pairwise Spanners and Approximate $D$-Preservers, Efficient Oracles and Routing Schemes for Replacement Paths