Pages that link to "Item:Q1999961"

The following pages link to Faster approximate diameter and distance oracles in planar graphs (Q1999961):

Displaying 3 items.

• Single-source shortest paths and strong connectivity in dynamic planar graphs (Q2051854) (← links)
• Single-Source Shortest Paths and Strong Connectivity in Dynamic Planar Graphs. (Q5874499) (← links)
• Shortest-Path Queries in Geometric Networks (Q6065461) (← links)