scientific article; zbMATH DE number 2119744

zbMATH Open1058.65028MaRDI QIDQ4829019FDOQ4829019

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

Publication date: 29 November 2004

Title of this publication is not available (Why is that?)

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

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)

Cited In (17)

• Geometric spanners with small chromatic number
• Many distances in planar graphs
• Algorithms and Computation
• Pruning spanners and constructing well-separated pair decompositions in the presence of memory hierarchies
• Title not available (Why is that?)
• Title not available (Why is that?)
• 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
• Title not available (Why is that?)
• 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)