Pages that link to "Item:Q4601870"
From MaRDI portal
The following pages link to Multiple-edge-fault-tolerant approximate shortest-path trees (Q4601870):
Displaying 15 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)
- Output sensitive fault tolerant maximum matching (Q2097219) (← links)
- Efficient Oracles and Routing Schemes for Replacement Paths (Q3304107) (← links)
- Fault-Tolerant Subgraph for Single-Source Reachability: General and Optimal (Q4602544) (← links)
- (Q4608014) (← links)
- Conditional hardness for sensitivity problems (Q4638076) (← links)
- (Q4887752) (← links)
- (Q5002751) (← links)
- (Q5092428) (← links)
- Sparse Weight Tolerant Subgraph for Single Source Shortest Path (Q5116479) (← links)
- Fault Tolerant Approximate BFS Structures (Q5384042) (← links)
- Improved approximations for relative survivable network design (Q6574948) (← links)