scientific article; zbMATH DE number 2119744

MaRDI QIDQ4829019zbMATH OpenFDO

Authors Joachim Gudmundsson, Giri Narasimhan, Christos Levcopoulos, Michiel Smid

Publication date 29 November 2004

zbMATH Keywords

geometric graphsdistance oraclesshortest path queries

Mathematics Subject Classification ID

Distance in graphs (05C12) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Recommendations

• scientific article; zbMATH DE number 1979513
• Approximate distance oracles for geometric spanners
• Algorithms and Computation
• Approximate distance oracles for graphs with dense clusters
• Approximate distance oracles

Cited in

(17)

• Geometric spanners with small chromatic number
• Many distances in planar graphs
• Pruning spanners and constructing well-separated pair decompositions in the presence of memory hierarchies
• Algorithms and Computation
• scientific article; zbMATH DE number 1979513 (Why is no real title available?)
• scientific article; zbMATH DE number 6469155 (Why is no real title available?)
• Ramsey partitions and proximity data structures
• Approximate distance oracles for graphs with dense clusters
• Truly Optimal Euclidean Spanners
• Compact Oracles for Approximate Distances Around Obstacles in the Plane
• Shortest-path queries in static networks
• Approximate Distance Queries in Disk Graphs
• Light Euclidean Spanners with Steiner Points
• Deformable spanners and applications
• scientific article; zbMATH DE number 7236428 (Why is no real title available?)
• Approximate distance oracles for geometric spanners
• Analysis of farthest point sampling for approximating geodesics in a graph

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4829019)