Distributed constructions of dual-failure fault-tolerant distance preservers
From MaRDI portal
Publication:6535019
DOI10.4230/LIPICS.DISC.2020.21zbMATH Open1540.68195MaRDI QIDQ6535019FDOQ6535019
Publication date: 2 November 2023
Graph theory (including graph drawing) in computer science (68R10) Distance in graphs (05C12) Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed algorithms (68W15)
Cites Work
- Finding the most vital node of a shortest path.
- Distributed Computing: A Locality-Sensitive Approach
- Chernoff–Hoeffding Bounds for Applications with Limited Independence
- Packet routing and job-shop scheduling in \(O\) (congestion + dilation) steps
- Fault tolerant additive and \((\mu, \alpha)\)-spanners
- Dual failure resilient BFS structure
- Replacement Paths and Distance Sensitivity Oracles via Fast Matrix Multiplication
- Improved Purely Additive Fault-Tolerant Spanners
- Title not available (Why is that?)
- Multiple Source Dual Fault Tolerant BFS Trees
- Near-optimal scheduling of distributed algorithms
- Vertex fault tolerant additive spanners
- Deterministic Combinatorial Replacement Paths and Distance Sensitivity Oracles
- Near Optimal Algorithms For The Single Source Replacement Paths Problem
- Replacement paths and k simple shortest paths in unweighted directed graphs
- Distributed algorithms for ultrasparse spanners and linear size skeletons
- Near-Additive Spanners In Low Polynomial Deterministic CONGEST Time
- Distributed construction of purely additive spanners
- Sparse Fault-Tolerant BFS Structures
- A near-linear-time algorithm for computing replacement paths in planar directed graphs
Cited In (1)
This page was built for publication: Distributed constructions of dual-failure fault-tolerant distance preservers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6535019)
