Approximate distance oracles for graphs with dense clusters
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1305410 (Why is no real title available?)
- scientific article; zbMATH DE number 1305420 (Why is no real title available?)
- scientific article; zbMATH DE number 1182917 (Why is no real title available?)
- scientific article; zbMATH DE number 1979513 (Why is no real title available?)
- scientific article; zbMATH DE number 2119744 (Why is no real title available?)
- scientific article; zbMATH DE number 910885 (Why is no real title available?)
- scientific article; zbMATH DE number 6469155 (Why is no real title available?)
- A decomposition of multidimensional point sets with applications to k -nearest-neighbors and n -body potential fields
- A note on two problems in connexion with graphs
- All-Pairs Almost Shortest Paths
- An efficient algorithm for shortest paths in vertical and horizontal segments
- An optimal algorithm for approximate nearest neighbor searching fixed dimensions
- Approximate distance oracles
- Computing hierarchies of clusters from the Euclidean minimum spanning tree in linear time
- Fast Algorithms for Constructing t-Spanners and Paths with Stretch t
- Fast Estimation of Diameter and Shortest Paths (Without Matrix Multiplication)
- Fibonacci heaps and their uses in improved network optimization algorithms
- Floats, Integers, and Single Source Shortest Paths
- Optimal algorithms for complete linkage clustering in \(d\) dimensions
- Planar spanners and approximate shortest path queries among obstacles in the plane
- STACS 2005
- Shortest Path Queries Among Weighted Obstacles in the Rectilinear Plane
- Shortest paths in the plane with polygonal obstacles
- Undirected single-source shortest paths with positive integer weights in linear time
Cited in
(4)
This page was built for publication: Approximate distance oracles for graphs with dense clusters
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q883232)
