scientific article; zbMATH DE number 437554
From MaRDI portal
Publication:3140432
Recommendations
- Efficient Algorithms for Geometric Graph Search Problems
- Polynomial-time approximation schemes for geometric graphs
- Graph-Theoretic Solutions to Computational Geometry Problems
- Approximation Algorithms for Geometric Intersection Graphs
- Parallel algorithms for geometric graph problems
- Fast enumeration algorithms for non-crossing geometric graphs
- Fast enumeration algorithms for non-crossing geometric graphs
- The geometry of graphs and some of its algorithmic applications
- Geometric speed-up techniques for finding shortest paths in large sparse graphs
- Algorithmic upper bounds for graph geodetic number
Cited in
(43)- Region-fault tolerant geometric spanners
- (Weakly) self-approaching geometric graphs and spanners
- Computing depth orders for fat objects and related problems
- On the power of the semi-separated pair decomposition
- Fractal dimension and lower bounds for geometric problems
- Local routing in sparse and lightweight geometric graphs
- On the speed of algebraically defined graph classes
- Sparse fault-tolerant spanners for doubling metrics with bounded hop-diameter or degree
- Average stretch factor: how low does it go?
- Matching point sets with respect to the earth mover's distance
- Deformable spanners and applications
- New Doubling Spanners: Better and Simpler
- On the Power of the Semi-Separated Pair Decomposition
- On locality-sensitive orderings and their applications
- Efficient Algorithms for Geometric Graph Search Problems
- scientific article; zbMATH DE number 177542 (Why is no real title available?)
- NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs
- A low arithmetic-degree algorithm for computing proximity graphs
- A fast and simple algorithm for computing approximate Euclidean minimum spanning trees
- Testing Euclidean Spanners
- Selection in monotone matrices and computing k th nearest neighbors
- On Locality-Sensitive Orderings and Their Applications
- Geometric minimum spanning trees via well-separated pair decompositions
- A fast minimum spanning tree algorithm based on \(K\)-means
- Spanners of Complete k-Partite Geometric Graphs
- Fast enumeration algorithms for non-crossing geometric graphs
- Lower bounds for computing geometric spanners and approximate shortest paths
- Fast Algorithms for Geometric Consensuses
- Online Spanners in Metric Spaces
- Geometric spanners for weighted point sets
- On the complexity of approximating Euclidean traveling salesman tours and minimum spanning trees
- Clustering under perturbation stability in near-linear time
- Engineering an algorithm for constructing low-stretch geometric graphs with near-greedy average degrees
- Semi-algebraic off-line range searching and biclique partitions in the plane
- On two simple[st] learning tasks
- Pargeo: a library for parallel computational geometry
- Online spanners in metric spaces
- Online Euclidean spanners
- Semi-algebraic off-line range searching and biclique partitions in the plane
- Compatible connectivity augmentation of planar disconnected graphs
- I/O-efficient algorithms for computing planar geometric spanners
- Well-separated pair decomposition in linear time?
- Pruning spanners and constructing well-separated pair decompositions in the presence of memory hierarchies
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 Q3140432)
