The following pages link to Geometric Spanner Networks (Q3445775):
Displayed 50 items.
- Light orthogonal networks with constant geometric dilation (Q1013080) (← links)
- Region-fault tolerant geometric spanners (Q1016540) (← links)
- Computing the dilation of edge-augmented graphs in metric spaces (Q1037772) (← links)
- Constrained generalized Delaunay graphs are plane spanners (Q1615887) (← links)
- (Weakly) self-approaching geometric graphs and spanners (Q1631774) (← links)
- An exact algorithm for the minimum dilation triangulation problem (Q1679486) (← links)
- Fault-tolerant spanners in networks with symmetric directional antennas (Q1680529) (← links)
- Tree spanners of bounded degree graphs (Q1693164) (← links)
- Continuous Yao graphs (Q1693326) (← links)
- Minimum rectilinear Steiner tree of \(n\) points in the unit square (Q1699296) (← links)
- Spanners for geodesic graphs and visibility graphs (Q1709579) (← links)
- Locating battery charging stations to facilitate almost shortest paths (Q1720301) (← links)
- Faster force-directed graph drawing with the well-separated pair decomposition (Q1736822) (← links)
- On plane constrained bounded-degree spanners (Q1739100) (← links)
- Routing in unit disk graphs (Q1742368) (← links)
- Computational complexity of the vertex cover problem in the class of planar triangulations (Q1744983) (← links)
- Approximating the generalized minimum Manhattan network problem (Q1751089) (← links)
- On the power of the semi-separated pair decomposition (Q1947974) (← links)
- On the stretch factor of randomly embedded random graphs (Q1953060) (← links)
- Computing the greedy spanner in near-quadratic time (Q1957650) (← links)
- Graph spanners: a tutorial review (Q2026289) (← links)
- Temporal cliques admit sparse spanners (Q2040022) (← links)
- Local geometric spanners (Q2067671) (← links)
- Light spanners for high dimensional norms via stochastic decompositions (Q2088589) (← links)
- Local routing in sparse and lightweight geometric graphs (Q2134745) (← links)
- On the spanning and routing ratios of the directed \(\Theta_6\)-graph (Q2144459) (← links)
- Routing among convex polygonal obstacles in the plane (Q2149846) (← links)
- Covering metric spaces by few trees (Q2168848) (← links)
- Routing in polygonal domains (Q2173455) (← links)
- Spanning properties of Theta-Theta-6 (Q2175787) (← links)
- Plane hop spanners for unit disk graphs: simpler and better (Q2206719) (← links)
- Bounded-degree spanners in the presence of polygonal obstacle (Q2220871) (← links)
- A spanner for the day after (Q2223618) (← links)
- Geodesic spanners for points in \(\mathbb{R}^3\) amid axis-parallel boxes (Q2224857) (← links)
- Quickest path queries on transportation network (Q2249042) (← links)
- Most finite point sets in the plane have dilation \(>1\) (Q2256585) (← links)
- Sparse fault-tolerant spanners for doubling metrics with bounded hop-diameter or degree (Q2258072) (← links)
- Conic nearest neighbor queries and approximate Voronoi diagrams (Q2261577) (← links)
- The \(\varTheta_5\)-graph is a spanner (Q2261580) (← links)
- Minimizing the sum of distances to a server in a constraint network (Q2330034) (← links)
- An improved upper bound on dilation of regular polygons (Q2330038) (← links)
- Geometric spanner games (Q2330124) (← links)
- Average stretch factor: how low does it go? (Q2340408) (← links)
- Reprint of: Theta-3 is connected (Q2341694) (← links)
- Fast algorithms for approximate Fréchet matching queries in geometric trees (Q2349741) (← links)
- Linear-size approximations to the Vietoris-Rips filtration (Q2391709) (← links)
- Upper and lower bounds for online routing on Delaunay triangulations (Q2408218) (← links)
- Fault tolerancy of continuous Yao graph of angle less than \(2\pi/5\) (Q2419798) (← links)
- Minimum Manhattan network problem in normed planes with polygonal balls: a factor 2.5 approximation algorithm (Q2429332) (← links)
- On certain geometric properties of the Yao-Yao graphs (Q2436661) (← links)