Oracles for Distances Avoiding a Failed Node or Link
From MaRDI portal
Recommendations
Cited in
(41)- Fault-tolerant approximate shortest-path trees
- Approximate shortest paths avoiding a failed vertex: near optimal data structures for undirected unweighted graphs
- Resilient capacity-aware routing
- Fault tolerant depth first search in undirected graphs: simple yet efficient
- Mincut sensitivity data structures for the insertion of an edge
- Improved distance sensitivity oracles with subcubic preprocessing time
- The impact of dynamic events on the number of errors in networks
- An experimental study on approximating k shortest simple paths
- The online replacement path problem
- Efficient oracles and routing schemes for replacement paths
- Connectivity oracles for graphs subject to vertex failures
- \(f\)-sensitivity distance oracles and routing schemes
- scientific article; zbMATH DE number 1979527 (Why is no real title available?)
- Fault-tolerant subgraph for single-source reachability: general and optimal
- Dual-failure distance and connectivity oracles
- scientific article; zbMATH DE number 2119745 (Why is no real title available?)
- Generic single edge fault tolerant exact distance oracle
- Deterministic Combinatorial Replacement Paths and Distance Sensitivity Oracles
- Fault tolerant and fully dynamic DFS in undirected graphs: simple yet efficient
- Sparse weight tolerant subgraph for single source shortest path
- Strong connectivity in directed graphs under failures, with applications
- A nearly optimal oracle for avoiding failed vertices and edges
- Dynamic DFS in undirected graphs: breaking the \(O(m)\) barrier
- Shortest paths avoiding forbidden subpaths
- Single source distance oracle for planar digraphs avoiding a failed node or link
- Improved Distance Sensitivity Oracles with Subcubic Preprocessing Time.
- Compact distance oracles with large sensitivity and low stretch
- Approximate distance sensitivity oracles in subquadratic space
- Approximate distance sensitivity oracles in subquadratic space
- An efficient strongly connected components algorithm in the fault tolerant model
- New extremal bounds for reachability and strong-connectivity preservers under failures
- Decremental sensitivity oracles for covering and packing minors
- \(f\)-sensitivity distance oracles and routing schemes
- New extremal bounds for reachability and strong-connectivity preservers under failures
- Near optimal algorithm for fault tolerant distance oracle and single source replacement path problem
- Constructing a distance sensitivity oracle in \(O(n^{2.5794}M)\) time
- Near optimal dual fault tolerant distance oracle
- Fault-tolerant bounded flow preservers
- Fault-tolerant ST-diameter oracles
- Undirected 3-fault replacement path in nearly cubic time
- Incremental distance products via faulty shortest paths
This page was built for publication: Oracles for Distances Avoiding a Failed Node or Link
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3532564)
