Pages that link to "Item:Q3532564"
From MaRDI portal
The following pages link to Oracles for Distances Avoiding a Failed Node or Link (Q3532564):
Displayed 24 items.
- The impact of dynamic events on the number of errors in networks (Q265066) (← links)
- On resilient graph spanners (Q289925) (← 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)
- 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)
- Resilient capacity-aware routing (Q2044217) (← 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)
- An Experimental Study on Approximating <i>k</i> Shortest Simple Paths (Q2828199) (← links)
- Efficient Oracles and Routing Schemes for Replacement Paths (Q3304107) (← links)
- Connectivity Oracles for Graphs Subject to Vertex Failures (Q3387763) (← links)
- Fault-Tolerant Subgraph for Single-Source Reachability: General and Optimal (Q4602544) (← links)
- (Q5002751) (← links)
- Deterministic Combinatorial Replacement Paths and Distance Sensitivity Oracles (Q5091160) (← links)
- (Q5092428) (← links)
- Sparse Weight Tolerant Subgraph for Single Source Shortest Path (Q5116479) (← links)
- Strong Connectivity in Directed Graphs under Failures, with Applications (Q5123984) (← links)
- Dynamic DFS in Undirected Graphs: Breaking the $O(m)$ Barrier (Q5232328) (← links)
- Shortest paths avoiding forbidden subpaths (Q5326797) (← links)
- (Q5743393) (← links)
- Improved Distance Sensitivity Oracles with Subcubic Preprocessing Time. (Q5874551) (← links)