Spanners for geometric intersection graphs with applications
From MaRDI portal
Publication:2968085
Recommendations
- Spanners for Geometric Intersection Graphs
- Hop-spanners for geometric intersection graphs
- On Spanners of Geometric Graphs
- On Spanners of Geometric Graphs
- ON SPANNERS OF GEOMETRIC GRAPHS
- Spanners for geodesic graphs and visibility graphs
- On spanners and lightweight spanners of geometric graphs
- Approximation Algorithms for Geometric Intersection Graphs
- On path-greedy geometric spanners
- scientific article; zbMATH DE number 1775442
Cited in
(16)- Constant-hop spanners for more geometric intersection graphs, with even smaller size
- ON SPANNERS OF GEOMETRIC GRAPHS
- An improved construction for spanners of disks
- Geometric Spanners for Points Inside a Polygonal Domain
- A unified framework for light spanners
- Spanners for Geometric Intersection Graphs
- Nearly Optimal Planar $k$ Nearest Neighbors Queries under General Distance Functions
- On plane geometric spanners: a survey and open problems
- Geometric spanners with applications in wireless networks
- Spanners of Complete k-Partite Geometric Graphs
- Dynamic planar Voronoi diagrams for general distance functions and their algorithmic applications
- On the power of the semi-separated pair decomposition
- Relaxed spanners for directed disk graphs
- scientific article; zbMATH DE number 741006 (Why is no real title available?)
- Spanners for directed transmission graphs
- Plane hop spanners for unit disk graphs: simpler and better
This page was built for publication: Spanners for geometric intersection graphs with applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2968085)
