Pages that link to "Item:Q1273930"
From MaRDI portal
The following pages link to A fully dynamic approximation scheme for shortest paths in planar graphs (Q1273930):
Displaying 12 items.
- Constant query time \((1 + \epsilon)\)-approximate distance oracle for planar graphs (Q1727393) (← links)
- Single-source shortest paths and strong connectivity in dynamic planar graphs (Q2051854) (← links)
- Distributed distance computation and routing with small messages (Q2422769) (← links)
- A survey on combinatorial optimization in dynamic environments (Q2907959) (← links)
- Dynamic Approximate Vertex Cover and Maximum Matching (Q4933386) (← links)
- (Q5009600) (← links)
- (Q5111734) (← links)
- Shortest-path queries in static networks (Q5176178) (← links)
- Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in Near-Linear Time (Q5348455) (← links)
- (Q5743404) (← links)
- Single-Source Shortest Paths and Strong Connectivity in Dynamic Planar Graphs. (Q5874499) (← links)
- Certifying fully dynamic algorithms for recognition and Hamiltonicity of threshold and chain graphs (Q6174822) (← links)
