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):
Displaying 50 items.
- On approximating tree spanners that are breadth first search trees (Q269500) (← links)
- 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)
- Distribution-sensitive construction of the greedy spanner (Q527422) (← 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)
- On the spanning and routing ratios of the directed \(\varTheta_6\)-graph (Q832828) (← links)
- Improved bounds on the spanning ratio of the theta-5-graph (Q832862) (← links)
- Graph spanners in the streaming model: An experimental study (Q834593) (← links)
- Small stretch \((\alpha ,\beta )\)-spanners in the streaming model (Q838152) (← links)
- Computing the greedy spanner in linear space (Q893321) (← links)
- Higher-order triangular-distance Delaunay graphs: graph-theoretical properties (Q904106) (← links)
- Towards tight bounds on theta-graphs: more is not always better (Q906396) (← 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)
- Constrained generalized Delaunay graphs are plane spanners (Q1615887) (← links)
- An exact algorithm for the minimum dilation triangulation problem (Q1679486) (← links)
- Tree spanners of bounded degree graphs (Q1693164) (← links)
- Cone-based spanners of constant degree (Q1699278) (← links)
- Strong matching of points with geometric shapes (Q1699290) (← links)
- Balancing minimum spanning trees and shortest-path trees (Q1899219) (← links)
- On shape Delaunay tessellations (Q2015147) (← links)
- Graph spanners: a tutorial review (Q2026289) (← links)
- Path-length analysis for grid-based path planning (Q2060684) (← links)
- On the spanning and routing ratios of the directed \(\Theta_6\)-graph (Q2144459) (← links)
- Spanning properties of Theta-Theta-6 (Q2175787) (← links)
- Dushnik-Miller dimension of TD-Delaunay complexes (Q2189828) (← links)
- Collective additive tree spanners of bounded tree-breadth graphs with generalizations and consequences (Q2253192) (← links)
- There are plane spanners of degree 4 and moderate stretch factor (Q2349855) (← links)
- Good triangulations yield good tours (Q2384914) (← links)
- Upper and lower bounds for online routing on Delaunay triangulations (Q2408218) (← links)
- The minimum Manhattan network problem: Approximations and exact solutions (Q2432734) (← links)
- Emanation graph: a plane geometric spanner with Steiner points (Q2698543) (← links)
- Lattice Spanners of Low Degree (Q2795942) (← links)
- Lattice spanners of low degree (Q2821117) (← links)
- Gabriel Triangulations and Angle-Monotone Graphs: Local Routing and Recognition (Q2961543) (← links)
- Network flow spanners (Q3057178) (← links)
- Connections between Theta-Graphs, Delaunay Triangulations, and Orthogonal Surfaces (Q3057631) (← links)
- YAO GRAPHS SPAN THETA GRAPHS (Q3166731) (← links)
- Optimal Local Routing on Delaunay Triangulations Defined by Empty Equilateral Triangles (Q3451755) (← links)
- Upper and Lower Bounds for Online Routing on Delaunay Triangulations (Q3452783) (← links)
- A PTAS for the Sparsest Spanners Problem on Apex-Minor-Free Graphs (Q3599135) (← links)
