Pages that link to "Item:Q5435672"
From MaRDI portal
The following pages link to Compact oracles for reachability and approximate distances in planar digraphs (Q5435672):
Displaying 13 items.
- Connectivity check in 3-connected planar graphs with obstacles (Q5300999) (← links)
- (Q5743390) (← links)
- (Q5743393) (← 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)
- Many distances in planar graphs (Q5920250) (← links)
- Fault-tolerant distance labeling for planar graphs (Q5970814) (← links)
- Compact Routing in Unit Disk Graphs (Q6065413) (← links)
- Labelings vs. embeddings: on distributed and prioritized representations of distances (Q6124827) (← links)
- Implicit representation of relations (Q6185606) (← links)
- Distributed planar reachability in nearly optimal time (Q6535037) (← links)
- Routing among convex polygonal obstacles in the plane (Q6610091) (← links)