Fault-tolerant ST-diameter oracles
From MaRDI portal
Cites work
- (1 + )-approximate f-sensitive distance oracles
- \(f\)-sensitivity distance oracles and routing schemes
- A nearly optimal oracle for avoiding failed vertices and edges
- Algorithms and hardness for diameter in dynamic graphs
- All pairs shortest paths using bridging sets and rectangular matrix multiplication
- Approximate distance sensitivity oracles in subquadratic space
- Approximate shortest paths avoiding a failed vertex: near optimal data structures for undirected unweighted graphs
- Approximate Single-Source Fault Tolerant Shortest Path
- Better approximation algorithms for the graph diameter
- Compact and fast sensitivity oracles for single-source distances
- Conditional hardness for sensitivity problems
- Connectivity oracles for failure prone graphs
- Constructing a distance sensitivity oracle in \(O(n^{2.5794}M)\) time
- Deterministic Combinatorial Replacement Paths and Distance Sensitivity Oracles
- Deterministic dictionaries
- Deterministic sensitivity oracles for diameter, eccentricities and all pairs distances
- Distance sensitivity oracles with subcubic preprocessing time and fast query time
- Dual-failure distance and connectivity oracles
- Efficient oracles and routing schemes for replacement paths
- Encyclopedia of algorithms. In 3 volumes
- Extremal Distances in Directed Graphs: Tight Spanners and Near-Optimal Approximation Algorithms
- Fast approximation algorithms for the diameter and radius of sparse graphs
- Fast Estimation of Diameter and Shortest Paths (Without Matrix Multiplication)
- Faster algorithms for approximate distance oracles and all-pairs small stretch paths
- Faster matrix multiplication via asymmetric hashing
- Faster replacement paths and distance sensitivity oracles
- Fault-tolerant \(ST\)-diameter oracles
- Generic single edge fault tolerant exact distance oracle
- scientific article; zbMATH DE number 5764802 (Why is no real title available?)
- scientific article; zbMATH DE number 1512678 (Why is no real title available?)
- scientific article; zbMATH DE number 2119745 (Why is no real title available?)
- scientific article; zbMATH DE number 7740873 (Why is no real title available?)
- scientific article; zbMATH DE number 7788486 (Why is no real title available?)
- scientific article; zbMATH DE number 7724191 (Why is no real title available?)
- Title not available (Why is no real title available?)
- Title not available (Why is no real title available?)
- Improved distance sensitivity oracles with subcubic preprocessing time
- Maintaining exact distances under multiple edge failures
- Matching is as easy as matrix inversion
- Multiple-edge-fault-tolerant approximate shortest-path trees
- Multiple-source shortest paths in embedded graphs
- New bounds for matrix multiplication: from alpha to omega
- New extremal bounds for reachability and strong-connectivity preservers under failures
- Optimality and Degeneracy in Linear Programming
- Oracles for Distances Avoiding a Failed Node or Link
- Replacement paths and distance sensitivity oracles via fast matrix multiplication
- Self-adjusting top trees
- Sensitive distance and reachability oracles for large batch updates
- Sensitivity and dynamic distance oracles via generic matrices and Frobenius form
- The All-Pairs Min Cut Problem and the Minimum Cycle Basis Problem on Planar Graphs
- Tight Approximation Algorithms for Bichromatic Graph Diameter and Related Problems
- Toward Tight Approximation Bounds for Graph Diameter and Eccentricities
- Undirected single-source shortest paths with positive integer weights in linear time
This page was built for publication: Fault-tolerant ST-diameter oracles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7294952)
