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 29 items.
- 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)
- DELAUNAY AND DIAMOND TRIANGULATIONS CONTAIN SPANNERS OF BOUNDED DEGREE (Q3636312) (← links)
- Constructing Linear-Sized Spectral Sparsification in Almost-Linear Time (Q4562276) (← links)
- The Greedy Spanner Is Existentially Optimal (Q4960447) (← links)
- (Q5009579) (← links)
- Euclidean Steiner Spanners: Light and Sparse (Q5043642) (← links)
- Truly Optimal Euclidean Spanners (Q5071083) (← links)
- Additive Spanners for Circle Graphs and Polygonal Graphs (Q5302048) (← links)
- (Q5743479) (← links)
- A note on optimal degree-three spanners of the square lattice (Q5866023) (← links)
- Light Euclidean Spanners with Steiner Points (Q5874539) (← links)
- Lower Bounds on the Dilation of Plane Spanners (Q5890540) (← links)
- The Price of Order (Q5892116) (← links)
- The Price of Order (Q5892451) (← links)
- A simple and efficient kinetic spanner (Q5902230) (← links)
- Drawing graphs as spanners (Q5918794) (← links)
- Hamiltonicity for convex shape Delaunay and Gabriel graphs (Q5918982) (← links)
- Lower bounds for computing geometric spanners and approximate shortest paths (Q5936458) (← links)
- Improved routing on the Delaunay triangulation (Q6050212) (← links)
- (Q6124757) (← links)
- On the spanning and routing ratio of the directed theta-four graph (Q6124828) (← links)
- Vertex Fault-Tolerant Geometric Spanners for Weighted Points (Q6173263) (← links)
- Vertex fault-tolerant spanners for weighted points in polygonal domains (Q6174157) (← links)
- Online Spanners in Metric Spaces (Q6195959) (← links)
- Bounded-degree plane geometric spanners in practice (Q6579765) (← links)
- Routing on heavy path WSPD spanners (Q6600811) (← links)
- New results on edge-coloring and total-coloring of split graphs (Q6648272) (← links)