f-Sensitivity Distance Oracles and Routing Schemes

DOI10.1007/978-3-642-15775-2_8zbMath1287.68027OpenAlexW2038855044MaRDI QIDQ3586453

Shiri Chechik, Michael Langberg, Liam Roditty, David Peleg

Publication date: 6 September 2010

Published in: Algorithms – ESA 2010 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-15775-2_8

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05)

Related Items (6)

Improved Purely Additive Fault-Tolerant Spanners ⋮ Path-Fault-Tolerant Approximate Shortest-Path Trees ⋮ Approximate shortest paths avoiding a failed vertex: near optimal data structures for undirected unweighted graphs ⋮ Fault-Tolerant Compact Routing Schemes for General Graphs ⋮ Fault-tolerant approximate shortest-path trees ⋮ Incremental distance products via faulty shortest paths

This page was built for publication: f-Sensitivity Distance Oracles and Routing Schemes