Pages that link to "Item:Q2933644"
From MaRDI portal
The following pages link to Replacement Paths and Distance Sensitivity Oracles via Fast Matrix Multiplication (Q2933644):
Displaying 11 items.
- An efficient strongly connected components algorithm in the fault tolerant model (Q666658) (← links)
- Incremental distance products via faulty shortest paths (Q783710) (← links)
- Invited talk: Resilient distributed algorithms (Q831782) (← links)
- Vertex fault tolerant additive spanners (Q1689749) (← links)
- Improved distance sensitivity oracles with subcubic preprocessing time (Q2237898) (← links)
- Deterministic Combinatorial Replacement Paths and Distance Sensitivity Oracles (Q5091160) (← links)
- Sparse Weight Tolerant Subgraph for Single Source Shortest Path (Q5116479) (← links)
- Improved Distance Sensitivity Oracles with Subcubic Preprocessing Time. (Q5874551) (← links)
- Distributed constructions of dual-failure fault-tolerant distance preservers (Q6535019) (← links)
- Approximate distance sensitivity oracles in subquadratic space (Q6566476) (← links)
- Near-optimal distributed computation of small vertex cuts (Q6579850) (← links)