scientific article
From MaRDI portal
Publication:3802644
zbMath0655.68087MaRDI QIDQ3802644
Publication date: 1988
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Graph theory (including graph drawing) in computer science (68R10) Euclidean geometries (general) and generalizations (51M05)
Related Items (41)
\( \delta \)-greedy \(t\)-spanner ⋮ Kinetic \(k\)-semi-Yao graph and its applications ⋮ Euclidean Steiner Spanners: Light and Sparse ⋮ Improved bounds on the spanning ratio of the theta-5-graph ⋮ Truly Optimal Euclidean Spanners ⋮ Ordered theta graphs ⋮ Spanning properties of Theta-Theta-6 ⋮ Theta-3 is connected ⋮ On path-greedy geometric spanners ⋮ Computing the greedy spanner in linear space ⋮ New Doubling Spanners: Better and Simpler ⋮ Generalized sweeping line spanners ⋮ On the spanning and routing ratio of the directed theta-four graph ⋮ Minimum weight Euclidean \((1+\varepsilon)\)-spanners ⋮ Local routing algorithms on Euclidean spanners with small diameter ⋮ Geometric Spanner of Objects under L 1 Distance ⋮ Generalized sweeping line spanners ⋮ Cone-based spanners of constant degree ⋮ Online Spanners in Metric Spaces ⋮ Towards tight bounds on theta-graphs: more is not always better ⋮ Emanation graph: a plane geometric spanner with Steiner points ⋮ The Euclidean bottleneck Steiner path problem and other applications of \((\alpha ,\beta )\)-pair decomposition ⋮ Unnamed Item ⋮ Geometric Spanner of Segments ⋮ Testing Euclidean Spanners ⋮ Light Euclidean Spanners with Steiner Points ⋮ There are planar graphs almost as good as the complete graphs and almost as cheap as minimum spanning trees ⋮ On sparse spanners of weighted graphs ⋮ Distribution-sensitive construction of the greedy spanner ⋮ Reachability problems for transmission graphs ⋮ Kinetic spanners in \(\mathbb R^{d}\) ⋮ The \(\varTheta_5\)-graph is a spanner ⋮ Connections between Theta-Graphs, Delaunay Triangulations, and Orthogonal Surfaces ⋮ Spanning Properties of Yao and 𝜃-Graphs in the Presence of Constraints ⋮ The Price of Order ⋮ Fixed-orientation equilateral triangle matching of point sets ⋮ Region-fault tolerant geometric spanners ⋮ Asymptotics of geometrical navigation on a random set of points in the plane ⋮ Reprint of: Theta-3 is connected ⋮ A simple, faster method for kinetic proximity problems ⋮ Approximating Euclidean distances by small degree graphs
This page was built for publication:
