Pages that link to "Item:Q1823959"
From MaRDI portal
The following pages link to There are planar graphs almost as good as the complete graph (Q1823959):
Displayed 29 items.
- On plane geometric spanners: a survey and open problems (Q359741) (← links)
- Collective additive tree spanners for circle graphs and polygonal graphs (Q444436) (← links)
- Tight stretch factors for \(L_1\)- and \(L_\infty\)-Delaunay triangulations (Q482347) (← links)
- On the stretch factor of Delaunay triangulations of points in convex position (Q621926) (← links)
- Almost all Delaunay triangulations have stretch factor greater than \(\pi /2\) (Q621930) (← links)
- Approximation of minimum weight spanners for sparse graphs (Q627187) (← links)
- Optimal spanners for axis-aligned rectangles (Q706725) (← links)
- Fixed-orientation equilateral triangle matching of point sets (Q744055) (← links)
- Graph spanners in the streaming model: An experimental study (Q834593) (← links)
- Small stretch \((\alpha ,\beta )\)-spanners in the streaming model (Q838152) (← links)
- Combinatorial network abstraction by trees and distances (Q954979) (← links)
- Light orthogonal networks with constant geometric dilation (Q1013080) (← links)
- Classes of graphs which approximate the complete Euclidean graph (Q1186079) (← links)
- Euclidean spanner graphs with degree four (Q1336638) (← links)
- Sorting helps for Voronoi diagrams (Q1355725) (← links)
- Beta-skeletons have unbounded dilation (Q1614068) (← links)
- Balancing minimum spanning trees and shortest-path trees (Q1899219) (← links)
- On shape Delaunay tessellations (Q2015147) (← links)
- Collective additive tree spanners of bounded tree-breadth graphs with generalizations and consequences (Q2253192) (← links)
- Good triangulations yield good tours (Q2384914) (← links)
- The minimum Manhattan network problem: Approximations and exact solutions (Q2432734) (← links)
- Network flow spanners (Q3057178) (← links)
- Connections between Theta-Graphs, Delaunay Triangulations, and Orthogonal Surfaces (Q3057631) (← links)
- YAO GRAPHS SPAN THETA GRAPHS (Q3166731) (← links)
- A PTAS for the Sparsest Spanners Problem on Apex-Minor-Free Graphs (Q3599135) (← links)
- DELAUNAY AND DIAMOND TRIANGULATIONS CONTAIN SPANNERS OF BOUNDED DEGREE (Q3636312) (← links)
- Additive Spanners for Circle Graphs and Polygonal Graphs (Q5302048) (← links)
- A simple and efficient kinetic spanner (Q5902230) (← links)
- Lower bounds for computing geometric spanners and approximate shortest paths (Q5936458) (← links)