Pages that link to "Item:Q692635"
From MaRDI portal
The following pages link to \(f\)-sensitivity distance oracles and routing schemes (Q692635):
Displayed 15 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)
- Compact routing messages in self-healing trees (Q1686108) (← links)
- Vertex fault tolerant additive spanners (Q1689749) (← links)
- Multiple-edge-fault-tolerant approximate shortest-path trees (Q2072097) (← links)
- Fault tolerant approximate BFS structures with additive stretch (Q2211352) (← 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)
- (Q4638076) (← links)
- Deterministic Combinatorial Replacement Paths and Distance Sensitivity Oracles (Q5091160) (← links)
- (Q5092428) (← links)
- Dynamic DFS in Undirected Graphs: Breaking the $O(m)$ Barrier (Q5232328) (← links)
- Compact distance oracles with large sensitivity and low stretch (Q6179407) (← links)
- Deterministic Fault-Tolerant Connectivity Labeling Scheme (Q6202245) (← links)