Euclidean spanner graphs with degree four
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 434498 (Why is no real title available?)
- scientific article; zbMATH DE number 4155925 (Why is no real title available?)
- scientific article; zbMATH DE number 4155926 (Why is no real title available?)
- A sparse graph almost as good as the complete graph on points in \(k\) dimensions
- Approximating Euclidean distances by small degree graphs
- CONSTRUCTING MULTIDIMENSIONAL SPANNER GRAPHS
- Classes of graphs which approximate the complete Euclidean graph
- Delaunay graphs are almost as good as complete graphs
- Efficient algorithms for agglomerative hierarchical clustering methods
- How Small Is a Unit Ball?
- On sparse spanners of weighted graphs
- There are planar graphs almost as good as the complete graph
Cited in
(7)- There are plane spanners of degree 4 and moderate stretch factor
- Approximating Euclidean distances by small degree graphs
- Degree-bounded minimum spanning trees
- Spanners under the Hausdorff and Fréchet distances
- Graphs in which each \(C_4\) spans \(K_4\)
- There are Plane Spanners of Maximum Degree 4
- Angle-constrained spanners with angle at least \(\pi/3\)
This page was built for publication: Euclidean spanner graphs with degree four
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1336638)
