Fault Tolerant Spanners for General Graphs
From MaRDI portal
Publication:5390599
DOI10.1137/090758039zbMath1209.68273OpenAlexW2022973561MaRDI QIDQ5390599
Liam Roditty, Shiri Chechik, Michael Langberg, David Peleg
Publication date: 4 April 2011
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/090758039
Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (11)
On resilient graph spanners ⋮ Fault tolerant depth first search in undirected graphs: simple yet efficient ⋮ Mincut sensitivity data structures for the insertion of an edge ⋮ Compact distance oracles with large sensitivity and low stretch ⋮ Fault-Tolerant Subgraph for Single-Source Reachability: General and Optimal ⋮ \(f\)-sensitivity distance oracles and routing schemes ⋮ Graph spanners: a tutorial review ⋮ Unnamed Item ⋮ Connectivity Oracles for Graphs Subject to Vertex Failures ⋮ Dynamic DFS in Undirected Graphs: Breaking the $O(m)$ Barrier ⋮ Output sensitive fault tolerant maximum matching
This page was built for publication: Fault Tolerant Spanners for General Graphs
