scientific article
From MaRDI portal
Publication:3484375
zbMath0704.68087MaRDI QIDQ3484375
No author found.
Publication date: 1989
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10)
Related Items
Beta-skeletons have unbounded dilation, Constrained generalized Delaunay graphs are plane spanners, Sparse hop spanners for unit disk graphs, Constructing competitive tours from local information, Constructing competitive tours from local information, Euclidean spanner graphs with degree four, Euclidean Steiner Spanners: Light and Sparse, Graph spanners in the streaming model: An experimental study, New results on MWT subgraphs, Competitive online routing in geometric graphs, Small stretch \((\alpha ,\beta )\)-spanners in the streaming model, A fast heuristic for approximating the minimum weight triangulation, Generating sparse 2—spanners, Good triangulations yield good tours, Minimum weight pseudo-triangulations, On plane geometric spanners: a survey and open problems, Vertex Fault-Tolerant Geometric Spanners for Weighted Points, Unnamed Item, 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, On exclusion regions for optimal triangulations, Unnamed Item, Lower Bounds on the Dilation of Plane Spanners, Lower Bounds on the Dilation of Plane Spanners, Vertex fault-tolerant spanners for weighted points in polygonal domains, Unnamed Item, Light orthogonal networks with constant geometric dilation, Triangulations intersect nicely, On the Stretch Factor of Polygonal Chains, Unnamed Item
