Pages that link to "Item:Q5172703"
From MaRDI portal
The following pages link to A nearly optimal oracle for avoiding failed vertices and edges (Q5172703):
Displaying 27 items.
- The impact of dynamic events on the number of errors in networks (Q265066) (← links)
- An efficient strongly connected components algorithm in the fault tolerant model (Q666658) (← links)
- \(f\)-sensitivity distance oracles and routing schemes (Q692635) (← links)
- Incremental distance products via faulty shortest paths (Q783710) (← links)
- Vertex fault tolerant additive spanners (Q1689749) (← links)
- Fault-tolerant approximate shortest-path trees (Q1799205) (← links)
- Approximate shortest paths avoiding a failed vertex: near optimal data structures for undirected unweighted graphs (Q1949751) (← links)
- Multiple-edge-fault-tolerant approximate shortest-path trees (Q2072097) (← links)
- Fault tolerant depth first search in undirected graphs: simple yet efficient (Q2149103) (← links)
- Mincut sensitivity data structures for the insertion of an edge (Q2165037) (← links)
- Improved distance sensitivity oracles with subcubic preprocessing time (Q2237898) (← links)
- Approximate Shortest Paths Avoiding a Failed Vertex: Optimal Size Data Structures for Unweighted Graphs (Q3113776) (← links)
- Efficient Oracles and Routing Schemes for Replacement Paths (Q3304107) (← links)
- Faster Replacement Paths and Distance Sensitivity Oracles (Q3384662) (← links)
- Connectivity Oracles for Graphs Subject to Vertex Failures (Q3387763) (← links)
- Improved Purely Additive Fault-Tolerant Spanners (Q3452780) (← links)
- Compact and Fast Sensitivity Oracles for Single-Source Distances (Q4606282) (← links)
- Truly Subcubic Algorithms for Language Edit Distance and RNA Folding via Fast Bounded-Difference Min-Plus Product (Q4634027) (← links)
- Conditional hardness for sensitivity problems (Q4638076) (← links)
- (Q5002751) (← links)
- Deterministic Combinatorial Replacement Paths and Distance Sensitivity Oracles (Q5091160) (← links)
- Sparse Weight Tolerant Subgraph for Single Source Shortest Path (Q5116479) (← links)
- Exact Distance Oracles for Planar Graphs with Failing Vertices (Q5236314) (← links)
- Shortest paths avoiding forbidden subpaths (Q5326797) (← links)
- (Q5743393) (← links)
- Improved Distance Sensitivity Oracles with Subcubic Preprocessing Time. (Q5874551) (← links)
- Approximate distance sensitivity oracles in subquadratic space (Q6566476) (← links)