Pages that link to "Item:Q1186079"
From MaRDI portal
The following pages link to Classes of graphs which approximate the complete Euclidean graph (Q1186079):
Displayed 50 items.
- On plane geometric spanners: a survey and open problems (Q359741) (← links)
- New constructions of SSPDs and their applications (Q419372) (← links)
- Compact and low delay routing labeling scheme for unit disk graphs (Q419502) (← links)
- On bounded degree plane strong geometric spanners (Q450575) (← links)
- Tight stretch factors for \(L_1\)- and \(L_\infty\)-Delaunay triangulations (Q482347) (← links)
- Minimum weight convex Steiner partitions (Q548652) (← links)
- On a family of strong geometric spanners that admit local routing strategies (Q551501) (← links)
- Ordered theta graphs (Q598550) (← 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)
- New approximation algorithms for minimum cycle bases of graphs (Q633843) (← links)
- Spanners of additively weighted point sets (Q635742) (← links)
- A generalized hypergreedy algorithm for weighted perfect matching (Q688623) (← links)
- Stable roommates spanner (Q691764) (← links)
- Some properties of \(k\)-Delaunay and \(k\)-Gabriel graphs (Q691765) (← links)
- Improved local algorithms for spanner construction (Q714769) (← 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)
- Routing on heavy-path WSPD-spanners (Q832910) (← links)
- Sparse geometric graphs with small dilation (Q929746) (← links)
- I/O-efficient algorithms for computing planar geometric spanners (Q929749) (← links)
- Bounds for the CRDT conformal mapping algorithm (Q977103) (← links)
- Empty region graphs (Q1000919) (← links)
- Light orthogonal networks with constant geometric dilation (Q1013080) (← links)
- Approximating Euclidean distances by small degree graphs (Q1317879) (← links)
- Euclidean spanner graphs with degree four (Q1336638) (← links)
- A fast algorithm for approximating the detour of a polygonal chain. (Q1428113) (← links)
- Constrained generalized Delaunay graphs are plane spanners (Q1615887) (← links)
- Coalescence of Euclidean geodesics on the Poisson-Delaunay triangulation (Q1708982) (← links)
- Locating battery charging stations to facilitate almost shortest paths (Q1720301) (← links)
- Improved spanning ratio for low degree plane spanners (Q1742372) (← links)
- Approximating geometric bottleneck shortest paths (Q1886239) (← links)
- A distributed algorithm to maintain a proximity communication network among mobile agents using the Delaunay triangulation (Q2034245) (← links)
- On the spanning and routing ratios of the directed \(\Theta_6\)-graph (Q2144459) (← links)
- Most finite point sets in the plane have dilation \(>1\) (Q2256585) (← links)
- The \(\varTheta_5\)-graph is a spanner (Q2261580) (← links)
- Sigma-local graphs (Q2266933) (← links)
- A simple, faster method for kinetic proximity problems (Q2344057) (← links)
- An \(O(1)\)-approximation algorithm for the 2-dimensional geometric freeze-tag problem (Q2345867) (← links)
- There are plane spanners of degree 4 and moderate stretch factor (Q2349855) (← links)
- Good triangulations yield good tours (Q2384914) (← links)
- On certain geometric properties of the Yao-Yao graphs (Q2436661) (← links)
- Local properties of geometric graphs (Q2456666) (← links)
- A PTAS for minimum vertex dilation triangulation of a simple polygon with a constant number of sources of dilation (Q2489546) (← links)
- On path-greedy geometric spanners (Q2678257) (← 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)
- Connections between Theta-Graphs, Delaunay Triangulations, and Orthogonal Surfaces (Q3057631) (← links)
- Disordered contact networks in jammed packings of frictionless disks (Q3302481) (← links)