Pages that link to "Item:Q584279"
From MaRDI portal
The following pages link to Delaunay graphs are almost as good as complete graphs (Q584279):
Displaying 50 items.
- Spanners of de Bruijn and Kautz graphs (Q287077) (← links)
- Spanners of underlying graphs of iterated line digraphs (Q287078) (← links)
- On plane geometric spanners: a survey and open problems (Q359741) (← links)
- Tight stretch factors for \(L_1\)- and \(L_\infty\)-Delaunay triangulations (Q482347) (← links)
- Approximating \(k\)-spanner problems for \(k>2\) (Q557826) (← 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)
- A generalized hypergreedy algorithm for weighted perfect matching (Q688623) (← links)
- Some properties of \(k\)-Delaunay and \(k\)-Gabriel graphs (Q691765) (← links)
- Cycle bases of graphs and sampled manifolds (Q733440) (← links)
- Toughness and Delaunay triangulations (Q803161) (← links)
- Sparse hop spanners for unit disk graphs (Q824328) (← links)
- Graph spanners in the streaming model: An experimental study (Q834593) (← links)
- Small stretch \((\alpha ,\beta )\)-spanners in the streaming model (Q838152) (← links)
- On the stabbing number of a random Delaunay triangulation (Q857055) (← links)
- Bounds for the CRDT conformal mapping algorithm (Q977103) (← links)
- Light orthogonal networks with constant geometric dilation (Q1013080) (← links)
- Classes of graphs which approximate the complete Euclidean graph (Q1186079) (← links)
- There are planar graphs almost as good as the complete graphs and almost as cheap as minimum spanning trees (Q1194346) (← links)
- On sparse spanners of weighted graphs (Q1196368) (← links)
- NP-completeness of minimum spanner problems (Q1315465) (← links)
- Approximating Euclidean distances by small degree graphs (Q1317879) (← links)
- Euclidean spanner graphs with degree four (Q1336638) (← links)
- Constructing sparse spanners for most graphs in higher dimensions (Q1336765) (← 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)
- Coalescence of Euclidean geodesics on the Poisson-Delaunay triangulation (Q1708982) (← links)
- Improved spanning ratio for low degree plane spanners (Q1742372) (← links)
- A sparse graph almost as good as the complete graph on points in \(k\) dimensions (Q1814131) (← links)
- There are planar graphs almost as good as the complete graph (Q1823959) (← links)
- Competitive online routing in geometric graphs (Q1887089) (← links)
- Affine invariant triangulations (Q2065637) (← links)
- Local routing in sparse and lightweight geometric graphs (Q2134745) (← links)
- Dushnik-Miller dimension of TD-Delaunay complexes (Q2189828) (← links)
- Plane hop spanners for unit disk graphs: simpler and better (Q2206719) (← links)
- There are plane spanners of degree 4 and moderate stretch factor (Q2349855) (← links)
- 10-Gabriel graphs are Hamiltonian (Q2353639) (← links)
- Upper and lower bounds for online routing on Delaunay triangulations (Q2408218) (← links)
- A PTAS for minimum vertex dilation triangulation of a simple polygon with a constant number of sources of dilation (Q2489546) (← links)
- Emanation graph: a plane geometric spanner with Steiner points (Q2698543) (← links)
- Connections between Theta-Graphs, Delaunay Triangulations, and Orthogonal Surfaces (Q3057631) (← 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)
- Competitive Online Routing on Delaunay Triangulations (Q4605336) (← links)
- MIXED SPANNING TREES IN THEORY AND PRACTICE (Q4949992) (← links)
- (Q5009579) (← links)
- Generating sparse 2—spanners (Q5056130) (← links)
