Dual Failure Resilient BFS Structure

DOI10.1145/2767386.2767408zbMath1333.05297arXiv1505.00692OpenAlexW2026486940MaRDI QIDQ2796286

Merav Parter

Publication date: 23 March 2016

Published in: Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1505.00692

zbMATH Keywords

lower boundsfault-tolerancereplacement-paths

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Approximation methods and heuristics in mathematical programming (90C59) Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85) Data structures (68P05) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items (12)

\textit{Renaissance}: a self-stabilizing distributed SDN control plane using in-band communications ⋮ Reachability Preservers: New Extremal Bounds and Approximation Algorithms ⋮ Unnamed Item ⋮ Fault-Tolerant Subgraph for Single-Source Reachability: General and Optimal ⋮ An efficient strongly connected components algorithm in the fault tolerant model ⋮ Graph spanners: a tutorial review ⋮ Fault-tolerant approximate shortest-path trees ⋮ Multiple-edge-fault-tolerant approximate shortest-path trees ⋮ Sparse Weight Tolerant Subgraph for Single Source Shortest Path ⋮ Output sensitive fault tolerant maximum matching ⋮ New Results on Linear Size Distance Preservers ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Memorization and Association on a Realistic Neural Model

This page was built for publication: Dual Failure Resilient BFS Structure