Pages that link to "Item:Q3459900"
From MaRDI portal
The following pages link to Constant Query Time $$(1+\epsilon )$$ -Approximate Distance Oracle for Planar Graphs (Q3459900):
Displaying 7 items.
- Constant query time \((1 + \epsilon)\)-approximate distance oracle for planar graphs (Q1727393) (← links)
- Faster approximate diameter and distance oracles in planar graphs (Q1999961) (← links)
- Single-source shortest paths and strong connectivity in dynamic planar graphs (Q2051854) (← links)
- Faster Approximate Diameter and Distance Oracles in Planar Graphs (Q5111711) (← links)
- (Q5115792) (← 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)
