Pages that link to "Item:Q5415545"
From MaRDI portal
The following pages link to Fully dynamic approximate distance oracles for planar graphs via forbidden-set distance labels (Q5415545):
Displaying 9 items.
- Single-source shortest paths and strong connectivity in dynamic planar graphs (Q2051854) (← links)
- Connectivity Oracles for Graphs Subject to Vertex Failures (Q3387763) (← links)
- (Q5009600) (← links)
- Decremental SPQR-trees for Planar Graphs (Q5009609) (← links)
- (Q5111734) (← links)
- Single-Source Shortest Paths and Strong Connectivity in Dynamic Planar Graphs. (Q5874499) (← links)
- Efficient dynamic approximate distance oracles for vertex-labeled planar graphs (Q5915659) (← links)
- Fault-tolerant distance labeling for planar graphs (Q5918639) (← links)
- Fault-tolerant distance labeling for planar graphs (Q5970814) (← links)
