The following pages link to Sparse Fault-Tolerant BFS Trees (Q2849365):
Displayed 13 items.
- An efficient strongly connected components algorithm in the fault tolerant model (Q666658) (← links)
- Vertex fault tolerant additive spanners (Q1689749) (← links)
- Fault-tolerant approximate shortest-path trees (Q1799205) (← links)
- Graph spanners: a tutorial review (Q2026289) (← links)
- Output sensitive fault tolerant maximum matching (Q2097219) (← links)
- Efficient Oracles and Routing Schemes for Replacement Paths (Q3304107) (← links)
- Connectivity Oracles for Graphs Subject to Vertex Failures (Q3387763) (← links)
- Improved Purely Additive Fault-Tolerant Spanners (Q3452780) (← links)
- Fault-Tolerant Subgraph for Single-Source Reachability: General and Optimal (Q4602544) (← links)
- (Q5002751) (← links)
- Sparse Weight Tolerant Subgraph for Single Source Shortest Path (Q5116479) (← links)
- New Results on Linear Size Distance Preservers (Q5858650) (← links)
- Reachability Preservers: New Extremal Bounds and Approximation Algorithms (Q6154193) (← links)