Ordered theta graphs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 2185613 (Why is no real title available?)
- scientific article; zbMATH DE number 4070353 (Why is no real title available?)
- scientific article; zbMATH DE number 1263225 (Why is no real title available?)
- scientific article; zbMATH DE number 718142 (Why is no real title available?)
- Classes of graphs which approximate the complete Euclidean graph
- Dynamic algorithms for geometric spanners of small diameter: Randomized solutions
- Dynamic fractional cascading
- Multidimensional divide-and-conquer
Cited in
(15)- Fast query structures in anisotropic media
- Geometric spanners with small chromatic number
- Kinetic spanners in \(\mathbb R^{d}\)
- On the power of the semi-separated pair decomposition
- Quickest path queries on transportation network
- On the average number of edges in theta graphs
- Fully dynamic geometric spanners
- Local properties of geometric graphs
- Online Spanners in Metric Spaces
- Generalized sweeping line spanners
- The price of order
- The price of order
- An Optimal Dynamic Spanner for Doubling Metric Spaces
- On the Power of the Semi-Separated Pair Decomposition
- Generalized sweeping line spanners
This page was built for publication: Ordered theta graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q598550)