Pages that link to "Item:Q5236314"
From MaRDI portal
The following pages link to Exact Distance Oracles for Planar Graphs with Failing Vertices (Q5236314):
Displaying 7 items.
- Single-source shortest paths and strong connectivity in dynamic planar graphs (Q2051854) (← links)
- Multiple-edge-fault-tolerant approximate shortest-path trees (Q2072097) (← links)
- A nearly optimal oracle for avoiding failed vertices and edges (Q5172703) (← links)
- Almost optimal distance oracles for planar graphs (Q5212755) (← links)
- Exact Distance Oracles for Planar Graphs with Failing Vertices (Q5236314) (← links)
- Fault-tolerant distance labeling for planar graphs (Q5918639) (← links)
- Fault-tolerant distance labeling for planar graphs (Q5970814) (← links)