Pages that link to "Item:Q1949751"
From MaRDI portal
The following pages link to Approximate shortest paths avoiding a failed vertex: near optimal data structures for undirected unweighted graphs (Q1949751):
Displayed 12 items.
- An efficient strongly connected components algorithm in the fault tolerant model (Q666658) (← links)
- Incremental distance products via faulty shortest paths (Q783710) (← links)
- Fault-tolerant approximate shortest-path trees (Q1799205) (← links)
- Multiple-edge-fault-tolerant approximate shortest-path trees (Q2072097) (← links)
- Efficient Oracles and Routing Schemes for Replacement Paths (Q3304107) (← links)
- Improved Purely Additive Fault-Tolerant Spanners (Q3452780) (← links)
- Path-Fault-Tolerant Approximate Shortest-Path Trees (Q3460718) (← links)
- Fault-Tolerant Subgraph for Single-Source Reachability: General and Optimal (Q4602544) (← links)
- (Q4638076) (← 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)