scientific article
From MaRDI portal
Publication:3140432
zbMath0801.68136MaRDI QIDQ3140432
Paul B. Callahan, S. Rao Kosaraju
Publication date: 29 November 1994
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Euclidean minimum spanning treewell-separated pair decompositionbichromatic closest pairgeometric graph problems
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Eulerian and Hamiltonian graphs (05C45)
Related Items (25)
On Locality-Sensitive Orderings and Their Applications ⋮ Local routing in sparse and lightweight geometric graphs ⋮ (Weakly) self-approaching geometric graphs and spanners ⋮ Selection in monotone matrices and computing k th nearest neighbors ⋮ On the Power of the Semi-Separated Pair Decomposition ⋮ A Low Arithmetic-Degree Algorithm for Computing Proximity Graphs ⋮ Computing depth orders for fat objects and related problems ⋮ New Doubling Spanners: Better and Simpler ⋮ Compatible connectivity augmentation of planar disconnected graphs ⋮ Online Spanners in Metric Spaces ⋮ Geometric spanners for weighted point sets ⋮ On the power of the semi-separated pair decomposition ⋮ I/O-efficient algorithms for computing planar geometric spanners ⋮ Testing Euclidean Spanners ⋮ Matching point sets with respect to the earth mover's distance ⋮ On Locality-Sensitive Orderings and Their Applications ⋮ A fast minimum spanning tree algorithm based on \(K\)-means ⋮ Well-separated pair decomposition in linear time? ⋮ Sparse fault-tolerant spanners for doubling metrics with bounded hop-diameter or degree ⋮ Lower bounds for computing geometric spanners and approximate shortest paths ⋮ Pruning spanners and constructing well-separated pair decompositions in the presence of memory hierarchies ⋮ Deformable spanners and applications ⋮ Spanners of Complete k-Partite Geometric Graphs ⋮ Region-fault tolerant geometric spanners ⋮ Average stretch factor: how low does it go?
This page was built for publication:
