scientific article; zbMATH DE number 4155925
From MaRDI portal
Publication:3484375
zbMATH Open0704.68087MaRDI QIDQ3484375FDOQ3484375
Authors:
Publication date: 1989
Title of this publication is not available (Why is that?)
Recommendations
- scientific article
- There are planar graphs almost as good as the complete graphs and almost as cheap as minimum spanning trees
- scientific article; zbMATH DE number 4070353
- Classes of graphs which approximate the complete Euclidean graph
- Triangulating planar graphs while minimizing the maximum degree
Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Network design and communication in computer systems (68M10)
Cited In (32)
- Sparse hop spanners for unit disk graphs
- Vertex fault-tolerant spanners for weighted points in polygonal domains
- Generating sparse 2—spanners
- Constrained generalized Delaunay graphs are plane spanners
- Title not available (Why is that?)
- Small stretch \((\alpha ,\beta )\)-spanners in the streaming model
- On exclusion regions for optimal triangulations
- Light orthogonal networks with constant geometric dilation
- Vertex Fault-Tolerant Geometric Spanners for Weighted Points
- On the Stretch Factor of Polygonal Chains
- New results on MWT subgraphs
- Title not available (Why is that?)
- Graph spanners in the streaming model: An experimental study
- There are planar graphs almost as good as the complete graph
- On sparse spanners of weighted graphs
- Title not available (Why is that?)
- Lower Bounds on the Dilation of Plane Spanners
- An improved upper bound for the universal TSP on the grid
- Beta-skeletons have unbounded dilation
- Constructing competitive tours from local information
- Good triangulations yield good tours
- Minimum weight pseudo-triangulations
- Euclidean spanner graphs with degree four
- Euclidean Steiner Spanners: Light and Sparse
- On plane geometric spanners: a survey and open problems
- A fast heuristic for approximating the minimum weight triangulation
- Title not available (Why is that?)
- Triangulations intersect nicely
- Constructing competitive tours from local information
- There are planar graphs almost as good as the complete graphs and almost as cheap as minimum spanning trees
- Competitive online routing in geometric graphs
- Lower bounds on the dilation of plane spanners
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3484375)
