f-sensitivity distance oracles and routing schemes

DOI10.1007/978-3-642-15775-2_8zbMATH Open1287.68027OpenAlexW2038855044MaRDI QIDQ3586453FDOQ3586453

Authors: 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

Recommendations

• \(f\)-sensitivity distance oracles and routing schemes
• \((1 + \epsilon)\)-approximate \(f\)-sensitive distance oracles
• A nearly optimal oracle for avoiding failed vertices and edges
• Compact and fast sensitivity oracles for single-source distances
• Oracles for Distances Avoiding a Failed Node or Link

Mathematics Subject Classification ID

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

Cited In (10)

• Fault-Tolerant Compact Routing Schemes for General Graphs
• \(f\)-sensitivity distance oracles and routing schemes
• Improved purely additive fault-tolerant spanners
• Compact and fast sensitivity oracles for single-source distances
• \((1 + \epsilon)\)-approximate \(f\)-sensitive distance oracles
• Approximate shortest paths avoiding a failed vertex: near optimal data structures for undirected unweighted graphs
• Fault-tolerant approximate shortest-path trees
• Path-fault-tolerant approximate shortest-path trees
• Incremental distance products via faulty shortest paths
• Oracles for Distances Avoiding a Failed Node or Link

This page was built for publication: \(f\)-sensitivity distance oracles and routing schemes

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