Pages that link to "Item:Q3113776"
From MaRDI portal
The following pages link to Approximate Shortest Paths Avoiding a Failed Vertex: Optimal Size Data Structures for Unweighted Graphs (Q3113776):
Displaying 10 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)
- \(f\)-sensitivity distance oracles and routing schemes (Q692635) (← links)
- Vertex fault tolerant additive spanners (Q1689749) (← links)
- Approximate shortest paths avoiding a failed vertex: near optimal data structures for undirected unweighted graphs (Q1949751) (← links)
- Fault tolerant approximate BFS structures with additive stretch (Q2211352) (← links)
- (Q5002751) (← links)
- Deterministic Combinatorial Replacement Paths and Distance Sensitivity Oracles (Q5091160) (← links)
- A nearly optimal oracle for avoiding failed vertices and edges (Q5172703) (← links)
- (Q5743393) (← links)